#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e3 + 22;
int n, m, a[MAXN * 1000];
bool dp[MAXN], tmp[MAXN];
int main() {
  ios::sync_with_stdio(false), cin.tie(0);
  cin >> n >> m;
  for (int i = 0, x; i < n; i++) {
    cin >> x;
    x %= m;
    a[i] = x;
  }
  if (n >= m) {
    cout << "YES";
    return 0;
  }
  for (int i = 0; i < n; i++) {
    memset(tmp, false, sizeof(tmp));
    for (int j = 0; j < m; j++) tmp[j] = dp[((j - a[i] + m) % m)];
    tmp[a[i]] = true;
    for (int j = 0; j < m; j++) dp[j] |= tmp[j];
  }
  if (dp[0])
    cout << "YES";
  else
    cout << "NO";
  return 0;
}
