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 = int64_t;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
void func() {
  ll n, m;
  cin >> n >> m;
  vll a(n);
  for (ll i = 0; i < n; i++) {
    cin >> a[i];
    a[i] %= m;
  }
  if (n > m) {
    cout << "YES" << endl;
    return;
  }
  vector<set<ll> > dp(n);
  if (a[0] == 0) {
    cout << "YES" << endl;
    return;
  }
  dp[0].insert(0);
  dp[0].insert(a[0]);
  for (ll i = 1; i < n; i++) {
    for (auto &r : dp[i - 1]) {
      dp[i].insert(r);
      ll new_r = (r + a[i]) % m;
      if (new_r == 0) {
        cout << "YES" << endl;
        return;
      }
      dp[i].insert(new_r);
    }
  }
  cout << "NO" << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  ;
  ll t = 1;
  for (ll i = 1; i <= t; i++) {
    func();
  }
}
