#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
const long long inf = 1e18;
int n, m;
long long pr[N], pt[N], tp[N];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  if (n > m) return cout << "YES\n", 0;
  for (int i = 1; i <= n; i++) {
    cin >> pt[i];
  }
  sort(pt + 1, pt + n + 1);
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < m; j++) tp[j] = 0;
    tp[pt[i] % m] = 1;
    for (int j = 0; j < m; j++) tp[(pt[i] % m + j) % m] |= pr[j];
    for (int j = 0; j < m; j++) pr[j] |= tp[j];
  }
  cout << (pr[0] ? "YES" : "NO");
}
