You are given a sequence of numbers a1, a2, ..., an, and a number m.

Check if it is possible to choose a non-empty subsequence aij such that the sum of numbers in this subsequence is divisible by m.

Input

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

The second line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 109).

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.

Examples

Input

3 5
1 2 3


Output

YES


Input

1 6
5


Output

NO


Input

4 6
3 1 1 3


Output

YES


Input

6 6
5 5 5 5 5 5


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.
#include <bits/stdc++.h>
using namespace std;
const int nt = (int)1e6 + 10;
int n, m, a[nt];
int dem[1001] = {0};
int f[1001][1001], ca[1001], fa[1001] = {0}, ct = 1;
int main() {
  cin >> n >> m;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    a[i] %= m;
    ++dem[a[i]];
    if (a[i] % m == 0) {
      cout << "YES";
      return 0;
    }
  }
  for (int i = 1; i <= m - 1; ++i)
    for (int j = 0; j <= m - 1; ++j) f[i][j] = 0;
  ca[1] = 0;
  for (int i = 1; i <= m - 1; ++i) {
    int CT = ct;
    for (int j = 1; j <= dem[i]; ++j) {
      int ka = i * j;
      f[i][ka] = 1;
      for (int z = 1; z <= CT; ++z) {
        int MU = (ca[z] + ka) % m;
        ;
        if (MU == 0) {
          cout << "YES";
          return 0;
        }
        if (fa[MU])
          continue;
        else {
          fa[MU] = 1;
          ca[++ct] = MU;
        }
      }
    }
  }
  cout << "NO";
}
