#include <bits/stdc++.h>
long long mpow(long long a, long long n, long long mod) {
  long long ret = 1;
  long long b = a;
  while (n) {
    if (n & 1) ret = (ret * b) % mod;
    b = (b * b) % mod;
    n >>= 1;
  }
  return (long long)ret;
}
using namespace std;
int dp[1000 + 5];
int a[1000004];
int dp1[1000 + 5];
int main() {
  int n, m;
  int i, j;
  scanf("%d%d", &n, &m);
  for (i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    a[i] %= m;
  }
  dp[0] = 1;
  sort(a + 1, a + n + 1);
  for (i = 1; i <= n; i++) {
    for (j = 0; j <= m; j++) {
      dp1[j] = 0;
      int z = (j - a[i]) % m;
      z = (z + m) % m;
      if (dp[z] != 0) dp1[j] = 1;
    }
    if (dp1[m]) {
      cout << "YES";
      return 0;
    }
    for (j = 0; j <= m; j++) dp[j] = (dp[j] || dp1[j]);
  }
  if (!dp[m])
    printf("NO");
  else
    printf("YES");
  return 0;
}
