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 string nameFiles = "";
void error(vector<string>::iterator) {}
template <typename T, typename... Args>
void error(vector<string>::iterator cur_var, T a, Args... args) {
  cerr << cur_var->substr((*cur_var)[0] == ' ') << " = " << a << endl;
  error(++cur_var, args...);
}
vector<string> split(string const& str, char c) {
  vector<string> res;
  stringstream ss(str);
  string x;
  while (getline(ss, x, c)) res.emplace_back(x);
  return move(res);
}
int main() {
  if (!nameFiles.empty()) {
    freopen((nameFiles + ".in").c_str(), "r", stdin);
    freopen((nameFiles + ".out").c_str(), "w", stdout);
  }
  int n, m;
  cin >> n >> m;
  vector<int> a(n);
  unordered_set<int> mod;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    a[i] %= m;
    if (a[i] == 0) {
      cout << "YES" << endl;
      return 0;
    }
  }
  for (int i = 0; i < n; ++i) {
    vector<int> ttt;
    for (int x : mod) {
      int temp = (x + a[i]) % m;
      if (temp == 0) {
        cout << "YES" << endl;
        return 0;
      }
      ttt.push_back(temp);
    }
    mod.insert(ttt.begin(), ttt.end());
    mod.insert(a[i]);
  }
  cout << "NO" << endl;
  return 0;
}
