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 double pi = acos(-1.0);
const int inf = 0x3f3f3f3f;
const double eps = 1e-15;
const long long INF = (1LL << 60);
int cnt[1010];
int a[1010];
int M[1010];
int m;
int dp[1010][1010][2];
int main() {
  int n, m, x;
  scanf("%d%d", &n, &m);
  memset(dp, 0, sizeof(dp));
  memset(cnt, 0, sizeof(cnt));
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &x);
    x %= m;
    ++cnt[x];
  }
  if (n > m) {
    printf("YES\n");
    return 0;
  }
  dp[0][0][0] = 1;
  for (int i = 0; i < m; ++i) {
    for (int j = 0; j < m; ++j) {
      if (dp[i][j][0]) {
        dp[i + 1][j][0] = 1;
      }
      if (dp[i][j][1]) {
        dp[i + 1][j][1] = 1;
      }
      for (int k = 1; k <= cnt[i]; ++k) {
        if (dp[i][j][0] || dp[i][j][1]) {
          dp[i + 1][(j + k * i) % m][1] = 1;
        }
      }
    }
  }
  bool flag = dp[m][0][1];
  puts(flag ? "YES" : "NO");
  return 0;
}
