{"problem":{"name":"Pasta","description":{"content":"There is pasta consisting of $N$ noodles at Takahashi's home. The length of the $i$\\-th noodle is $A_i$.   Takahashi has a meal plan for the next $M$ days. On the $i$\\-th day, he is going to choose a ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc241_b"},"statements":[{"statement_type":"Markdown","content":"There is pasta consisting of $N$ noodles at Takahashi's home. The length of the $i$\\-th noodle is $A_i$.  \nTakahashi has a meal plan for the next $M$ days. On the $i$\\-th day, he is going to choose a pasta noodle of length exactly $B_i$ and eat it. If no such noodle is available on any day, his plan fails. Additionally, he cannot eat the same noodle on multiple days.\nCan Takahashi accomplish his meal plan?\n\n## Constraints\n\n*   $1 \\leq M \\leq N \\leq 1000$\n*   $1 \\leq A_i \\leq 10^9$\n*   $1 \\leq B_i \\leq 10^9$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $M$\n$A_1$ $A_2$ $\\ldots$ $A_N$\n$B_1$ $B_2$ $\\ldots$ $B_M$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc241_b","tags":[],"sample_group":[["3 2\n1 1 3\n3 1","Yes\n\nHe can eat the $3$\\-rd noodle on the $1$\\-st day and the $1$\\-st noodle on the $2$\\-nd day, so his meal plan is feasible."],["1 1\n1000000000\n1","No\n\nA noodle of length exactly $1$ is needed."],["5 2\n1 2 3 4 5\n5 5","No\n\nSince there are only $1$ noodle of length $5$, he cannot have a meal on the $2$\\-nd day."]],"created_at":"2026-03-03 11:01:13"}}