{"problem":{"name":"Takahashi's Failure","description":{"content":"Takahashi has $N$ foods in his house. The $i$\\-th food has the tastiness of $A_i$.   He dislikes $K$ of these foods: for each $i=1,2,\\ldots,K$, he dislikes the $B_i$\\-th food. Out of the foods with th","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc252_b"},"statements":[{"statement_type":"Markdown","content":"Takahashi has $N$ foods in his house. The $i$\\-th food has the tastiness of $A_i$.  \nHe dislikes $K$ of these foods: for each $i=1,2,\\ldots,K$, he dislikes the $B_i$\\-th food.\nOut of the foods with the greatest tastiness among the $N$ foods, Takahashi will randomly choose one and eat it.  \nIf he has a chance to eat something he dislikes, print `Yes`; otherwise, print `No`.\n\n## Constraints\n\n*   $1\\leq K\\leq N\\leq 100$\n*   $1\\leq A_i\\leq 100$\n*   $1\\leq B_i\\leq N$\n*   All $B_i$ are distinct.\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $K$\n$A_1$ $A_2$ $\\ldots$ $A_N$\n$B_1$ $B_2$ $\\ldots$ $B_K$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc252_b","tags":[],"sample_group":[["5 3\n6 8 10 7 10\n2 3 4","Yes\n\nAmong the five foods, the ones with the greatest tastiness are Food $3$ and $5$, of which he eats one.  \nHe dislikes Food $2$, $3$, and $4$, one of which he has a chance to eat: Food $3$.  \nTherefore, the answer is `Yes`."],["5 2\n100 100 100 1 1\n5 4","No\n\nThe foods with the greatest tastiness are Food $1$, $2$, and $3$, none of which he has a chance to eat."],["2 1\n100 1\n2","No\n\nThe food with the greatest tastiness is Food $1$, which he has no chance to eat."]],"created_at":"2026-03-03 11:01:14"}}