Contest Duration: - (local time) (100 minutes) Back to Home
C - Ideal Holidays /

Time Limit: 2 sec / Memory Limit: 1024 MB

### 問題文

AtCoder 王国の 1 週間は A+B 日からなり、1 日目から A 日目が休日で、A+1 日目から A+B 日目が平日です。

### 制約

• 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

### 入力

N A B
D_1 D_2 \ldots D_N


### 入力例 1

3 2 5
1 2 9


### 出力例 1

Yes


### 入力例 2

2 5 10
10 15


### 出力例 2

No


### 入力例 3

4 347 347
347 700 705 710


### 出力例 3

Yes


Score: 350 points

### 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