#include <bits/stdc++.h>
using namespace std;
int mod = 1e9 + 7;
long long powmod(long long a, long long b) {
  long long res = 1;
  if (a >= mod) a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a;
    if (res >= mod) res %= mod;
    a = a * a;
    if (a >= mod) a %= mod;
  }
  return res;
}
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
int ok[1005] = {0};
int main() {
  int i, j, t;
  int z, n, m, x, y;
  scanf("%d%d", &n, &m);
  for (i = 1; i <= n; i++) {
    scanf("%d", &x);
    x = x % m;
    for (j = 0; j < m; j++) {
      if (ok[j] == 0 || ok[j] == i) continue;
      z = x + j;
      if (z >= m) z -= m;
      if (ok[z] == 0) ok[z] = i;
    }
    ok[x] = i;
    if (ok[0]) {
      puts("YES\n");
      return 0;
    }
  }
  puts("NO\n");
  return 0;
}
