#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m;
  cin >> n >> m;
  if (n >= m) {
    printf("YES");
    return 0;
  }
  int a[n];
  vector<int> v;
  bool isNumberAvailable[m];
  memset(isNumberAvailable, 0, sizeof(isNumberAvailable));
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  for (int i = 0; i < n; i++) {
    v.clear();
    v.push_back(a[i] % m);
    for (int j = 0; j < m; j++) {
      if (isNumberAvailable[j]) v.push_back((a[i] + j) % m);
    }
    for (auto it : v) {
      isNumberAvailable[it] = true;
    }
  }
  if (isNumberAvailable[0]) {
    printf("YES\n");
    return 0;
  }
  printf("NO\n");
  return 0;
}
