#include <bits/stdc++.h>
const long long mod = (long long)1e9 + 7;
using namespace std;
long long n, m;
vector<long long> vc;
long long dp[1001][1001][2];
long long rec(long long idx, long long sum, long long fl) {
  if (idx == n) {
    if (fl == 0) return 0;
    if (sum == 0) return 1;
    return 0;
  }
  long long &ans = dp[idx][sum][fl];
  if (ans != -1) return ans;
  ans = 0;
  ans = rec(idx + 1, (vc[idx] + sum) % m, 1ll);
  ans = max(ans, rec(idx + 1, sum, fl));
  return ans;
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  memset(dp, -1, sizeof dp);
  cin >> n >> m;
  vc.resize(n);
  for (long long i = 0; i < n; i++) cin >> vc[i];
  if (n > m) {
    cout << "YES\n";
    return 0;
  }
  rec(0, 0, 0) ? cout << "YES\n" : cout << "NO\n";
  return 0;
}
