#include <bits/stdc++.h>
using namespace std;
long long int a[1000005];
long long int dp[1005][1005];
long long int n, m;
int main() {
  long long int i, j, k, t;
  scanf("%I64d %I64d", &n, &m);
  long long int f = 0;
  for (i = 0; i < n; i++) {
    scanf("%I64d", &a[i]);
  }
  if (n > m) {
    cout << "YES\n";
    return 0;
  }
  for (i = 0; i <= n; i++) dp[i][0] = 1;
  for (i = 1; i <= n; i++) {
    for (j = 0; j <= m; j++) {
      dp[i][j] = (dp[i - 1][j] | dp[i - 1][(j + (a[i - 1])) % m]);
    }
  }
  if (dp[n][m])
    cout << "YES\n";
  else
    cout << "NO\n";
  return 0;
}
