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;
using ll = long long;
using ld = long double;
const int inf = 0x3c3c3c3c;
const long long infl = 0x3c3c3c3c3c3c3c3c;
const int MAX_N = 1e6 + 9, MAX_M = 1e3 + 9;
int n, m;
int a[MAX_N];
int dp[MAX_M][MAX_M][2];
bool isPossible(int idx, int remainVal, int isEmpty) {
  int &res = dp[idx][remainVal][isEmpty];
  if (idx == n) {
    if (isEmpty || remainVal) {
      return false;
    }
    return true;
  }
  if (res != -1) {
    return res;
  }
  res = 0;
  res = max(isPossible(idx + 1, (remainVal + a[idx]) % m, false),
            isPossible(idx + 1, remainVal, isEmpty));
  return res;
}
int main() {
  cin.tie(NULL);
  cin.sync_with_stdio(false);
  cout.sync_with_stdio(false);
  memset(dp, -1, sizeof(dp));
  cin >> n >> m;
  if (n >= MAX_M) return !printf("YES");
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] == 0) {
      return !printf("YES");
    }
  }
  printf("%s", isPossible(0, 0, true) ? "YES" : "NO");
}
