#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
long long int can[1005][1005];
long long int n, m, a[1005];
void solve() {
  cin >> n >> m;
  if (n > m) {
    long long int x;
    for (long long int i = 0; i < n; i++) cin >> x;
    cout << "YES";
  } else {
    for (long long int i = 1; i < n + 1; i++) {
      cin >> a[i];
      a[i] %= m;
    }
    for (long long int i = 0; i < n + 1; i++) can[i][0] = 1;
    for (long long int i = 1; i < n + 1; i++) {
      for (long long int j = 0; j < m + 1; j++) {
        can[i][j] = (can[i - 1][(j + a[i]) % m] || can[i - 1][j]);
      }
    }
    if (can[n][m])
      cout << "YES";
    else
      cout << "NO";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int T = 1;
  while (T--) solve();
  return 0;
}
