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;
unsigned long long n, m;
map<pair<unsigned long long, unsigned long long>, bool> dp;
bool finish, zero(false), ans;
unsigned long long tab[1000005];
bool fun(unsigned long long i, unsigned long long sum,
         unsigned long long rsum) {
  if (finish) return true;
  if (!sum && rsum) return (dp[make_pair(i, sum)] = finish = true);
  if (i == n) return false;
  if (dp.count(make_pair(i, sum))) return dp[make_pair(i, sum)];
  return dp[make_pair(i, sum)] =
             fun(i + 1, sum, rsum) ||
             fun(i + 1, (sum + tab[i]) % m, (rsum + tab[i]));
}
int main() {
  cin >> n >> m;
  if (n > m) {
    cout << "YES";
    return 0;
  }
  finish = false;
  for (unsigned long long i = 0; i < n; i++) {
    unsigned long long x;
    cin >> x;
    tab[i] = x % m;
    if (!tab[i]) zero = true;
  }
  if (zero) {
    cout << "YES";
    return 0;
  }
  ans = fun(0, 0, 0);
  if (ans)
    cout << "YES";
  else
    cout << "NO";
  return 0;
}
