#include <bits/stdc++.h>
using namespace std;
string vow = "aeiou";
int month[] = {-1, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int dxhorse[] = {-2, -2, -1, -1, 1, 1, 2, 2};
const int dyhorse[] = {1, -1, 2, -2, 2, -2, 1, -1};
const int dx[] = {-1, 0, 0, 1};
const int dy[] = {0, -1, 1, 0};
const long double pie = 3.14159265358979;
const long long mod = 1e9 + 7;
int n, m;
vector<int> v;
void good() {
  cout << "YES";
  cout << "\n";
  ;
  exit(0);
}
void read() {
  cin >> n >> m;
  if (n >= m) good();
  v.resize(n);
  for (int i = 0; i < n; i++) {
    cin >> v[i];
    v[i] %= m;
  }
}
const int N = 1e3 + 2, inf = 1e5;
bool vis[N][N];
void f(int indx, int rem) {
  if (indx < 0) return;
  if (vis[indx][rem]) return;
  vis[indx][rem] = 1;
  f(indx - 1, rem);
  rem += v[indx];
  rem %= m;
  if (rem == 0) good();
  f(indx - 1, rem);
}
void solve(int test_case) {
  read();
  f(n - 1, 0);
  cout << "NO";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  for (int i = 0; i < t; i++) solve(i);
  return 0;
}
