#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const long double pi = acos((ld)-1.0);
const double eps = (double)1e-9;
const int inf = 1e9 + 7;
int main() {
  int n, m;
  cin >> n >> m;
  if (n > m)
    cout << "YES\n";
  else {
    vector<vector<int>> can(n + 1, vector<int>(m, 0));
    int a[n];
    for (int i = 0; i < n; i++) {
      cin >> a[i];
      can[i + 1][a[i] % m] = 1;
    }
    for (int i = 0; i < n; i++) {
      for (int r = 0; r < m; r++) {
        if (can[i][r]) {
          can[i + 1][r] = 1;
          can[i + 1][(r + a[i]) % m] = 1;
        }
      }
    }
    if (can[n][0])
      cout << "YES\n";
    else
      cout << "NO\n";
  }
  return 0;
}
const int fastio = []() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  return 0;
}();
