#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int M = 1e6 + 5;
const int MOD = 1e9 + 7;
const int CM = 998244353;
const int INF = 0x3f3f3f3f;
const double eps = 1e-6;
template <typename T>
T MAX(T a, T b) {
  return a > b ? a : b;
}
template <typename T>
T MIN(T a, T b) {
  return a > b ? b : a;
}
template <typename T>
T GCD(T a, T b) {
  return b == 0 ? a : GCD(b, a % b);
}
template <typename T>
T LCM(T a, T b) {
  return a / GCD(a, b) * b;
}
template <typename T>
T ABS(T a, T b) {
  return a > 0 ? a : -a;
}
template <typename T>
T ADD(T a, T b, T MOD) {
  return (a + b) % MOD;
}
template <typename T>
T DEL(T a, T b, T MOD) {
  return ((a - b) % MOD + MOD) % MOD;
}
std::set<int> vx;
void solve() {
  int n, m;
  cin >> n >> m;
  if (n >= m) {
    printf("YES\n");
    return;
  }
  for (int i = 1; i <= n; i++) {
    int a;
    cin >> a;
    std::vector<int> v;
    for (auto x : vx) {
      v.push_back(x);
    }
    vx.insert(a % m);
    for (auto x : v) {
      vx.insert((x + a) % m);
    }
  }
  if (vx.count(0) != 0)
    printf("YES\n");
  else
    printf("NO\n");
}
void TIME() {
  clock_t start, finish;
  double totaltime;
  start = clock();
  solve();
  finish = clock();
  totaltime = (double)(finish - start) / CLOCKS_PER_SEC;
  printf("\nTime:%lfms\n", totaltime * 1000);
}
int main() {
  solve();
  return 0;
}
