{"raw_statement":[{"iden":"problem statement","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."},{"iden":"constraints","content":"*   $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."},{"iden":"partial score","content":"*   $100$ points will be awarded for passing the test set satisfying $N \\leq 100$ and $M \\leq 100$."},{"iden":"input","content":"Input 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$"},{"iden":"sample input 1","content":"5\n3 1 4 1 5\n3\n5 4 3"},{"iden":"sample output 1","content":"YES"},{"iden":"sample input 2","content":"7\n100 200 500 700 1200 1600 2000\n6\n100 200 500 700 1600 1600"},{"iden":"sample output 2","content":"NO\n\nNot enough $1600$s."},{"iden":"sample input 3","content":"1\n800\n5\n100 100 100 100 100"},{"iden":"sample output 3","content":"NO"},{"iden":"sample input 4","content":"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"},{"iden":"sample output 4","content":"YES"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}