#include <bits/stdc++.h>
using namespace std;
int n, m;
int an[50010];
bool vis[50010][1000][2];
bool anw[50010][1000][2];
bool sw(int p, int ms, int c) {
  if (p == n) {
    if (ms == 0 && c) return true;
    return false;
  }
  if (vis[p][ms][c]) return anw[p][ms][c];
  vis[p][ms][c] = true;
  bool w1 = sw(p + 1, ms, c);
  bool w2 = sw(p + 1, (ms + an[p]) % m, 1);
  return anw[p][ms][c] = w1 || w2;
}
int main() {
  cin >> n >> m;
  if (n > 10000) {
    cout << "YES" << endl;
    return 0;
  }
  for (int i = 0; i < n; i++) {
    scanf("%d", &an[i]);
    an[i] %= m;
  }
  cout << (sw(0, 0, false) ? "YES" : "NO") << endl;
}
