#include <bits/stdc++.h>
using namespace std;
int an[1010000];
bool visit[2][1100];
int main() {
  int z;
  int n, m;
  int i, j, k;
  cin >> n >> m;
  for (i = 1; i <= n; i++) scanf("%d", &an[i]);
  if (n >= m)
    cout << "YES" << endl;
  else {
    memset(visit, 0, sizeof(visit));
    visit[0][0] = 1;
    for (i = 1; i <= n; i++) {
      int md = an[i] % m;
      for (j = 0; j < m; j++) {
        if (visit[i - 1 & 1][j]) {
          visit[i & 1][(j + md) % m] = 1;
          if ((j + md) % m == 0) {
            cout << "YES" << endl;
            return 0;
          }
        }
      }
      for (j = 0; j < m; j++) {
        if (visit[i - 1 & 1][j]) visit[i & 1][j] = 1;
      }
    }
    cout << "NO" << endl;
  }
  return 0;
}
