{"problem":{"name":"Problem Set","description":{"content":"Rng is preparing a problem set for a qualification round of CODEFESTIVAL. He has $N$ candidates of problems. The difficulty of the $i$\\-th candidate is $D_i$. There must be $M$ problems in the problem","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"code_festival_2017_qualb_b"},"statements":[{"statement_type":"Markdown","content":"Rng is preparing a problem set for a qualification round of CODEFESTIVAL.\nHe has $N$ candidates of problems. The difficulty of the $i$\\-th candidate is $D_i$.\nThere must be $M$ problems in the problem set, and the difficulty of the $i$\\-th problem must be $T_i$. Here, one candidate of a problem cannot be used as multiple problems.\nDetermine whether Rng can complete the problem set without creating new candidates of problems.\n\n## Constraints\n\n*   $1 \\leq N \\leq 200,000$\n*   $1 \\leq D_i \\leq 10^9$\n*   $1 \\leq M \\leq 200,000$\n*   $1 \\leq T_i \\leq 10^9$\n*   All numbers in the input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$D_1$ $D_2$ $...$ $D_N$\n$M$\n$T_1$ $T_2$ $...$ $T_M$\n\n## Partial Score\n\n*   $100$ points will be awarded for passing the test set satisfying $N \\leq 100$ and $M \\leq 100$.\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"code_festival_2017_qualb_b","tags":[],"sample_group":[["5\n3 1 4 1 5\n3\n5 4 3","YES"],["7\n100 200 500 700 1200 1600 2000\n6\n100 200 500 700 1600 1600","NO\n\nNot enough $1600$s."],["1\n800\n5\n100 100 100 100 100","NO"],["15\n1 2 2 3 3 3 4 4 4 4 5 5 5 5 5\n9\n5 4 3 2 1 2 3 4 5","YES"]],"created_at":"2026-03-03 11:01:14"}}