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