#include <bits/stdc++.h>
const int MAXN = 1000002;
const int MAXM = 1010;
int n, m;
int a[MAXN];
bool mask[2][MAXM];
int main() {
  scanf("%d %d", &n, &m);
  for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
  memset(mask, 0, sizeof(mask));
  bool* cur_mask = mask[0];
  bool* next_mask = mask[1];
  for (int i = 0; i < n && !cur_mask[0]; ++i) {
    int v = a[i] % m;
    next_mask[v] = true;
    for (int j = 1; j < m; ++j) {
      if (cur_mask[j]) {
        next_mask[j] = 1;
        next_mask[(v + j) % m] = true;
      }
    }
    std::swap(cur_mask, next_mask);
  }
  printf("%s", cur_mask[0] ? "YES" : "NO");
  return 0;
}
