{"problem":{"name":"Ideal Holidays","description":{"content":"In the Kingdom of AtCoder, a week consists of $A+B$ days, with the first through $A$\\-th days being holidays and the $(A+1)$\\-th through $(A+B)$\\-th being weekdays. Takahashi has $N$ plans, and the $i","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc347_c"},"statements":[{"statement_type":"Markdown","content":"In the Kingdom of AtCoder, a week consists of $A+B$ days, with the first through $A$\\-th days being holidays and the $(A+1)$\\-th through $(A+B)$\\-th being weekdays.\nTakahashi has $N$ plans, and the $i$\\-th plan is scheduled $D_i$ days later.\nHe has forgotten what day of the week it is today. Determine if it is possible for all of his $N$ plans to be scheduled on holidays.\n\n## Constraints\n\n*   $1\\leq N\\leq 2\\times 10^5$\n*   $1\\leq A,B\\leq 10^9$\n*   $1\\leq D_1<D_2<\\ldots<D_N\\leq 10^9$\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$ $A$ $B$\n$D_1$ $D_2$ $\\ldots$ $D_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc347_c","tags":[],"sample_group":[["3 2 5\n1 2 9","Yes\n\nIn this input, a week consists of seven days, with the first through second days being holidays and the third through seventh days being weekdays.\nLet us assume today is the seventh day of the week. In this case, one day later would be the first day of the week, two days later would be the second day of the week, and nine days later would also be the second day of the week, making all plans scheduled on holidays. Therefore, it is possible for all of Takahashi's $N$ plans to be scheduled on holidays."],["2 5 10\n10 15","No"],["4 347 347\n347 700 705 710","Yes"]],"created_at":"2026-03-03 11:01:14"}}