#include <bits/stdc++.h>
using namespace std;
vector<int> cur;
int n, m;
int vis[1005];
int cnt = 0;
int a;
void f(int x) {
  if (!vis[x]) {
    cur.push_back(x);
    vis[x] = 1;
  }
  return;
}
int main() {
  cin >> n >> m;
  while (n--) {
    scanf("%d", &a);
    int s = cur.size();
    for (int i = 0; i < s; i++) {
      f((cur[i] + a) % m);
    }
    f(a % m);
    if (vis[0]) break;
  }
  cout << (vis[0] ? "YES" : "NO");
  return 0;
}
