#include <bits/stdc++.h>
using namespace std;
const long long N = 1000010;
vector<long long> v;
long long sum[N];
map<long long, int> val;
bool falt = false;
long long dp[1001][1001];
int n, m;
void calc(int i, int j) {
  if (j % m == 0 && j != 0) falt = true;
  if (i >= n) return;
  if (dp[i][j] != -1) return;
  if ((j + v[i]) % m == 0) falt = true;
  calc(i + 1, (j + v[i]) % m);
  calc(i + 1, j);
  dp[i][j] = 1;
}
int main() {
  long long x;
  long long total = 0, d = 0;
  bool ans = false;
  cin >> n >> m;
  for (int i = 0; i < n; ++i) {
    scanf("%lld", &x);
    v.push_back(x);
    if (x % m == 0) ans = true;
    if (val[x] == 0) d++;
    val[x]++;
  }
  if (d >= m || n >= 1000) ans = true;
  if (!ans) {
    memset(dp, -1, sizeof(dp));
    calc(0, 0);
  }
  if (falt) ans = true;
  if (ans)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
