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 ull = unsigned long long;
template <typename T>
using S = set<T>;
using SI = S<int>;
template <typename T>
using US = unordered_set<T>;
using USI = US<int>;
template <typename T>
using V = vector<T>;
using VB = V<bool>;
using VI = V<int>;
using VVI = V<VI>;
template <typename T>
ostream& operator<<(ostream& os, const S<T>& s) {
  os << "{";
  for (auto it = s.begin(), next = s.begin(); s.end() != next; it = next) {
    os << *it;
    ++next;
    if (s.end() != next) {
      os << ", ";
    }
  }
  return os << "}";
}
template <typename T>
ostream& operator<<(ostream& os, const US<T>& us) {
  os << "u{";
  for (auto it = us.begin(), next = us.begin(); us.end() != next; it = next) {
    os << *it;
    ++next;
    if (us.end() != next) {
      os << ", ";
    }
  }
  return os << "}";
}
template <typename T>
ostream& operator<<(ostream& os, const V<T>& v) {
  os << "[";
  for (auto it = v.begin(), next = v.begin(); v.end() != next; it = next) {
    os << *it;
    ++next;
    if (v.end() != next) {
      os << ", ";
    }
  }
  return os << "]";
}
template <typename T>
const T& abs(const T& x) {
  if (x >= 0) {
    return x;
  }
  return -x;
}
template <typename T>
V<T>& uniq(V<T>& v) {
  const auto newend_it = unique(v.begin(), v.end());
  v.resize(newend_it - v.begin());
  return v;
}
struct E {
  int u, v;
};
ostream& operator<<(ostream& os, const E& e) {
  return os << "(" << e.u << ", " << e.v << ")";
}
bool operator<(const E& l, const E& r) {
  return l.u < r.u || (l.u == r.u && l.v < r.v);
}
template <typename T>
constexpr T cshift(const T t, size_t left_shift_bits = 1) {
  constexpr size_t T_bits = sizeof(T) * 8;
  left_shift_bits %= T_bits;
  left_shift_bits += T_bits;
  left_shift_bits %= T_bits;
  const size_t right_shift_bits = T_bits - left_shift_bits;
  return (t << left_shift_bits) ^ (t >> right_shift_bits);
}
int main() {
  int n, m;
  bitset<2000> bs(0b0), tmp;
  cin >> n >> m;
  ;
  ;
  for (int i = 0; i < int(n); i++) {
    int ai;
    cin >> ai;
    ai %= m;
    bs |= bs << ai;
    bs.set(ai);
    do {
      tmp = bs;
      bs |= bs >> m;
    } while (bs != tmp);
    if (bs[0]) {
      cout << "YES" << endl;
      return 0;
    }
  }
  cout << "NO" << endl;
  return 0;
}
