#include <bits/stdc++.h>
using namespace std;
int n, m, a[1000006], i, j;
bool dp[1004][2], x;
int main() {
  memset(dp, 0, sizeof(dp));
  scanf("%d %d", &n, &m);
  for (i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    a[i] %= m;
    if (a[i] == 0) {
      printf("YES\n");
      return 0;
    }
  }
  for (i = 1; i < m; i++) dp[i][0] = 0;
  dp[0][0] = 1;
  for (j = 1; j <= n; j++) {
    for (i = 0; i < m; i++) {
      x = dp[(i - a[j - 1] + m) % m][(j - 1) & 1];
      dp[i][j & 1] = dp[i][(j - 1) & 1] || x;
      if (i == 0 && x) {
        printf("YES\n");
        return 0;
      }
    }
  }
  printf("NO\n");
  return 0;
}
