#include <bits/stdc++.h>
using namespace std;
bool can[1005][1005];
long long a[1000002];
int main() {
  int n, m;
  cin >> n >> m;
  if (n > m) {
    cout << "YES" << endl;
    return 0;
  } else {
    long long mi = INT_MAX;
    for (int i = 1; i <= n; i++) {
      cin >> a[i];
      if (a[i] < mi) mi = a[i];
    }
    memset(can, false, sizeof(can));
    for (int i = 1; i <= n; i++) {
      can[i][a[i] % m] = true;
      for (int j = 0; j <= m; j++) {
        if (can[i - 1][j]) {
          can[i][j] = true;
          can[i][((j % (m)) + ((a[i]) % (m))) % (m)] = true;
        }
      }
    }
    bool ans = false;
    for (int i = 1; i <= n; i++) {
      if (can[i][0]) {
        ans = true;
        break;
      }
    }
    if ((ans) || (mi == 0))
      cout << "YES";
    else
      cout << "NO";
  }
  return 0;
}
