#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[1000003];
int memo[10003][1003][2];
int calcMemo(int i, int x, bool ok) {
  if (x == 0 && ok) {
    return 1;
  }
  if (i == min(n + 1, 10000)) {
    return 0;
  }
  int &ret = memo[i][x][ok];
  if (ret != -1) return ret;
  int res1 = calcMemo(i + 1, (x + a[i]) % m, 1);
  int res2 = calcMemo(i + 1, x, ok);
  return ret = res1 | res2;
}
int main() {
  scanf("%d%d", &n, &m);
  int temp;
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  sort(a + 1, a + 1 + n);
  memset(memo, -1, sizeof memo);
  if (calcMemo(1, 0, 0))
    cout << "YES\n";
  else
    cout << "NO\n";
  return 0;
}
