#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
const int M = 1e3 + 10;
bool f[M], g[M];
int b[M];
int c[20];
int d[20];
int main() {
  c[0] = 1;
  for (int i = 1; i < 20; i++) c[i] = c[i - 1] << 1;
  int n, m;
  while (~scanf("%d%d", &n, &m)) {
    memset(b, 0, sizeof(b));
    for (int i = 0, x; i < n; i++) {
      scanf("%d", &x);
      b[x % m]++;
      if (x % m == 0) {
        printf("YES\n");
        return 0;
      }
    }
    memset(f, 0, sizeof(f));
    memset(g, 0, sizeof(g));
    f[0] = 1;
    bool flag = 0;
    for (int i = 1; i < m; i++) {
      int top = 0;
      while (b[i]) {
        if (b[i] >= c[top])
          d[top] = c[top];
        else
          d[top] = b[i];
        b[i] -= d[top];
        top++;
      }
      for (int j = 0; j < top; j++) {
        int y = d[j] * i;
        for (int k = m; k >= 0; k--) {
          if (f[k]) {
            g[(k + y) % m] = 1;
          }
        }
        if (g[0]) {
          flag = 1;
          break;
        }
        for (int k = 0; k <= m; k++) {
          if (g[k]) f[k] = 1;
        }
      }
    }
    printf("%s\n", flag ? "YES" : "NO");
  }
  return 0;
}
