Modulo Sum

Description:

Input:

The first line contains two numbers, n and m (1 ≤ n ≤ 10⁶, 2 ≤ m ≤ 10³) — the size of the original sequence and the number such that sum should be divisible by it.

The second line contains n integers a₁, a₂, ..., a_n (0 ≤ a_i ≤ 10⁹).

Output:

In the single line print either "YES" (without the quotes) if there exists the sought subsequence, or "NO" (without the quotes), if such subsequence doesn't exist.

Sample Input:

3 5
1 2 3

Sample Output:

YES

Sample Input:

1 6
5

Sample Output:

NO

Sample Input:

4 6
3 1 1 3

Sample Output:

YES

Sample Input:

6 6
5 5 5 5 5 5

Sample Output:

YES

Note:

In the first sample test you can choose numbers 2 and 3, the sum of which is divisible by 5.

In the second sample test the single non-empty subsequence of numbers is a single number 5. Number 5 is not divisible by 6, that is, the sought subsequence doesn't exist.

In the third sample test you need to choose two numbers 3 on the ends.

In the fourth sample test you can take the whole subsequence.