#include <bits/stdc++.h>
using namespace std;
long long p, n, x, y, m, w, z, q, t, a[1000];
vector<long long> v;
int main() {
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    cin >> x;
    x %= m;
    y = v.size();
    for (int j = 0; j < y; j++) {
      if (a[(v[j] + x) % m] == 0) {
        a[(v[j] + x) % m] = 1;
        v.push_back((v[j] + x) % m);
      }
    }
    if (a[x] == 0) {
      a[x] = 1;
      v.push_back(x);
    }
    if (a[0] == 1) break;
    if (v.size() == m) break;
  }
  if (a[0] == 1)
    cout << "YES";
  else
    cout << "NO";
  return 0;
}
