#include <bits/stdc++.h>
const long long MOD = (long long)1e9 + 7;
using namespace std;
long long power(long long a, long long b) {
  if (b == 0) return 1;
  if (b % 2 == 0) {
    long long f = 1LL * power(a, b / 2);
    return 1LL * f * f;
  }
  b--;
  return 1LL * power(a, b) * a;
}
int left(int i) { return 2 * i; }
int right(int i) { return 2 * i + 1; }
vector<vector<pair<int, int>>> graph(501);
struct Node {
 private:
  int x, dist, prev;

 public:
  Node(int a, int b, int c) { x = a, dist = b, prev = c; }
  Node(int a) { x = a, dist = 0, prev = a; }
  Node(int a, int b) { x = a, dist = b; }
  int getDist() { return dist; }
  int getX() { return x; }
  int getPrev() { return prev; }
};
struct cmp {
  bool operator()(Node &a, Node &b) { return a.getDist() < b.getDist(); }
};
void addEdge(int u, int v, int w) {
  graph[u].push_back(make_pair(v, w));
  graph[v].push_back(make_pair(u, w));
}
int a[1000003];
bool dp[10000];
vector<int> dp2;
int main() {
  int n, m;
  dp[0] = true;
  scanf("%d %d", &n, &m);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    if (dp[(m - ((a[i]) % m)) % m]) {
      cout << "YES"
           << "\n";
      exit(0);
    }
    int cnt = 0;
    for (int j = 0; j < dp2.size() - cnt; j++) {
      if (!dp[(dp2[j] + a[i]) % m]) {
        cnt++;
        dp[(dp2[j] + a[i]) % m] = true;
        dp2.push_back((dp2[j] + a[i]) % m);
      }
    }
    dp[a[i] % m] = true;
    dp2.push_back(a[i] % m);
  }
  cout << "NO"
       << "\n";
}
