Score: $350$ points

问题陈述

在AtCoder王国，一周由$A+B$天组成，前$A$天是假期，第$(A+1)$天到第$(A+B)$天是工作日。

高桥有$N$个计划，第$i$个计划安排在$D_i$天后。

他忘记了今天是周几。请确定他的所有$N$个计划是否都可能安排在假期。

以上为大语言模型 kimi 翻译，仅供参考。

Problem Statement

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$-th plan is scheduled $D_i$ days later.

He 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.

Constraints

• $1\leq N\leq 2\times 10^5$
• $1\leq A,B\leq 10^9$
• $1\leq D_1<D_2<\ldots<D_N\leq 10^9$

Input

The input is given from Standard Input in the following format:

$N$ $A$ $B$

$D_1$ $D_2$ $\ldots$ $D_N$

Output

Print Yes in a single line if it is possible for all of Takahashi's $N$ plans to be scheduled on holidays, and No otherwise.

Sample Input 1

3 2 5
1 2 9

Sample Output 1

Yes

In this input, a week consists of seven days, with the first through second days being holidays and the third through seventh days being weekdays.

Let 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.

Sample Input 2

2 5 10
10 15

Sample Output 2

No

Sample Input 3

4 347 347
347 700 705 710

Sample Output 3

Yes