#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m;
  cin >> n >> m;
  if (n > m)
    cout << "YES" << endl;
  else {
    vector<int> a(n, 0);
    for (int i = 0; i < n; ++i) {
      cin >> a[i];
      a[i] %= m;
    }
    vector<vector<int> > can(n + 1, vector<int>(m, 0));
    can[0][0] = 1;
    for (int i = 0; i < n; ++i) {
      for (int v = 0; v < m; ++v) {
        if (can[i][v] == 0) continue;
        if (can[i + 1][(v + a[i]) % m] == 0)
          can[i + 1][(v + a[i]) % m] = can[i][v];
        else
          can[i + 1][(v + a[i]) % m] = 2;
        if (can[i + 1][v] == 0)
          can[i + 1][v] = can[i][v];
        else
          can[i + 1][v] = 2;
      }
    }
    if (can[n][0] == 2)
      cout << "YES" << endl;
    else
      cout << "NO" << endl;
  }
  return 0;
}
