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>
const long long MOD = (long long)1e9 + 7;
using namespace std;
long long power(long long a, long long b) {
  if (b == 0) return 1;
  if (b % 2 == 0) {
    long long f = 1LL * power(a, b / 2);
    return 1LL * f * f;
  }
  b--;
  return 1LL * power(a, b) * a;
}
int left(int i) { return 2 * i; }
int right(int i) { return 2 * i + 1; }
vector<vector<pair<int, int>>> graph(501);
struct Node {
 private:
  int x, dist, prev;

 public:
  Node(int a, int b, int c) { x = a, dist = b, prev = c; }
  Node(int a) { x = a, dist = 0, prev = a; }
  Node(int a, int b) { x = a, dist = b; }
  int getDist() { return dist; }
  int getX() { return x; }
  int getPrev() { return prev; }
};
struct cmp {
  bool operator()(Node &a, Node &b) { return a.getDist() < b.getDist(); }
};
void addEdge(int u, int v, int w) {
  graph[u].push_back(make_pair(v, w));
  graph[v].push_back(make_pair(u, w));
}
int a[1000003];
bool dp[10000];
vector<int> dp2;
int main() {
  int n, m;
  dp[0] = true;
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    if (dp[(m - ((a[i]) % m)) % m]) {
      cout << "YES"
           << "\n";
      exit(0);
    }
    int cnt = 0;
    for (int j = 0; j < dp2.size() - cnt; j++) {
      if (!dp[(dp2[j] + a[i]) % m]) {
        cnt++;
        dp[(dp2[j] + a[i]) % m] = true;
        dp2.push_back((dp2[j] + a[i]) % m);
      }
    }
    dp[a[i] % m] = true;
    dp2.push_back(a[i] % m);
  }
  cout << "NO"
       << "\n";
}
