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