#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 5;
int n, m, frq[N], dp[N][N][2];
int solve(int num = 0, int sum = 0, bool go = 0) {
  if (!sum && go) {
    cout << "YES";
    exit(0);
  }
  if (num == m) return 0;
  int &ret = dp[num][sum][go];
  if (~ret) return ret;
  int ans = 0;
  for (int i = 0; i <= frq[num]; ++i)
    ans |= solve(num + 1, (sum + num * i) % m, i | go);
  return ret = ans;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  memset(dp, -1, sizeof dp);
  while (n--) {
    int x;
    cin >> x;
    ++frq[x % m];
  }
  solve();
  cout << "NO";
  return 0;
}
