#include <bits/stdc++.h>
using namespace std;
int n, m, a[1000005], dp[1005][1005][2];
bool solve(int idx, int rem, bool b) {
  if (idx == n) return (rem == 0 && b);
  if (dp[idx][rem][b] != -1) return dp[idx][rem][b];
  return dp[idx][rem][b] =
             solve(idx + 1, rem, b) || solve(idx + 1, (rem + a[idx]) % m, 1);
}
int main() {
  cin >> n >> m;
  memset(dp, -1, sizeof(dp));
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  if (n > m)
    cout << "YES" << endl;
  else
    cout << (solve(0, 0, 0) ? "YES" : "NO") << endl;
  return 0;
}
