{"problem":{"name":"Non-divisible Set","description":{"content":"We say that a set $S$ of positive integers is _good_ when, for any $a,\\ b \\in S\\ (a\\neq b)$, $b$ is not a multiple of $a$. You are given a set of $N$ integers between $1$ and $2M$ (inclusive): $S=\\lbr","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc141_d"},"statements":[{"statement_type":"Markdown","content":"We say that a set $S$ of positive integers is _good_ when, for any $a,\\ b \\in S\\ (a\\neq b)$, $b$ is not a multiple of $a$.\nYou are given a set of $N$ integers between $1$ and $2M$ (inclusive): $S=\\lbrace A_1,\\ A_2,\\ \\dots,\\ A_N\\rbrace$.\nFor each $i=1,\\ 2,\\ \\dots,\\ N$, determine whether there exists a good set with $M$ elements that is a subset of $S$ containing $A_i$.\n\n## Constraints\n\n*   $M \\leq N \\leq 2M$\n*   $1 \\leq M \\leq 3 \\times 10^5$\n*   $1 \\leq A_1 < A_2 < \\dots < A_N \\leq 2M$\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$ $\\dots$ $A_{N}$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc141_d","tags":[],"sample_group":[["5 3\n1 2 3 4 5","No\nYes\nYes\nYes\nYes\n\nTrivially, the only good set containing $A_1=1$ is $\\lbrace 1\\rbrace$, which has just one element, so the answer for $i=1$ is `No`.\nThere is a good set $\\lbrace 2,\\ 3,\\ 5\\rbrace$ containing $A_2=2$, so the answer for $i=2$ is `Yes`."],["4 4\n2 4 6 8","No\nNo\nNo\nNo"],["13 10\n2 3 4 6 7 9 10 11 13 15 17 19 20","No\nNo\nYes\nYes\nYes\nYes\nYes\nYes\nYes\nYes\nYes\nYes\nNo"]],"created_at":"2026-03-03 11:01:14"}}