#include <bits/stdc++.h>
using namespace std;
int i, j, k, l, n, m, a[1010], b[1010 * 50], f[1010][2];
int main() {
  scanf("%d%d", &n, &m);
  for (i = 1; i <= n; i++) {
    scanf("%d", &k);
    k %= m;
    if (k == 0)
      a[m]++;
    else
      a[k]++;
  }
  for (i = 1; i <= m; i++) {
    j = -1;
    while (a[i]) {
      j++;
      if (a[i] - (1 << j) >= 0)
        a[i] -= (1 << j);
      else
        break;
      if (i * (1 << j) % m != 0)
        b[++b[0]] = i * (1 << j) % m;
      else
        b[++b[0]] = m;
    }
    if (a[i]) {
      if (a[i] * i % m != 0)
        b[++b[0]] = a[i] * i % m;
      else
        b[++b[0]] = m;
    }
  }
  f[0][0] = 1;
  for (i = 1; i <= b[0]; i++) {
    for (j = 0; j <= m; j++) f[j][i & 1] = f[j][(i - 1) & 1];
    for (j = m; j >= 0; j--)
      if (f[j][(i - 1) & 1] && j + b[i] <= m)
        f[j + b[i]][i & 1] = 1;
      else if (f[j][(i - 1) & 1] && j + b[i] > m)
        f[(j + b[i]) % m][i & 1] = 1;
  }
  if (f[m][b[0] & 1])
    printf("YES\n");
  else
    printf("NO\n");
}
