#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int maxn = 1e6 + 10;
int dp[1010][1010], a[maxn], b[1010];
int main() {
  int n, m;
  while (~scanf("%d%d", &n, &m)) {
    memset(dp, 0, sizeof(dp));
    for (int i = 1; i <= n; i++) {
      scanf("%d", &a[i]);
      a[i] = a[i] % m;
    }
    if (n > m) {
      printf("YES\n");
      continue;
    }
    for (int i = 0; i <= n; i++) dp[i][0] = 1;
    for (int i = 1; i <= n; i++) {
      for (int j = 0; j <= m; j++) {
        dp[i][j] = dp[i - 1][j] || dp[i - 1][(j + a[i]) % m];
      }
    }
    int flag = 0;
    if (dp[n][m])
      printf("YES\n");
    else
      printf("NO\n");
  }
  return 0;
}
