#include <bits/stdc++.h>
using namespace std;
const int N = 1001;
int a[2][N], b[N];
int main(void) {
  int n, m, i, j, k;
  scanf("%d%d", &n, &m);
  for (i = 1; i <= m; i++) b[i] = i;
  b[0] = m;
  memset(a, 0, sizeof(a));
  a[0][0] = 1;
  for (i = 1; a[(i + 1) & 1][m] == 0 && i <= n; i++) {
    scanf("%d", &k);
    k %= m;
    for (j = 0; j <= m; j++) a[i & 1][j] = a[(i + 1) & 1][j];
    for (j = 1; j <= b[0];)
      if (a[(i + 1) & 1][((b[j] - k) % m + m) % m]) {
        a[i & 1][b[j]] = 1;
        b[j] = b[b[0]--];
      } else
        j++;
  }
  if (a[0][m] || a[1][m])
    printf("YES");
  else
    printf("NO");
  return 0;
}
