#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
const int M = 1e3 + 5;
const int INF = 1e9 + 5;
const int mod = 1e9 + 7;
int n, m, a[N], dp[M];
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m;
  for (int i = 1; i <= n; i++) cin >> a[i];
  if (n > m) {
    cout << "YES\n";
    return 0;
  }
  for (int i = 1; i <= n; i++) {
    vector<int> tmp(m);
    tmp[a[i] % m] = 1;
    for (int j = 0; j < m; j++) {
      tmp[j] |= dp[j];
      tmp[(j + a[i]) % m] |= dp[j];
    }
    for (int j = 0; j < m; j++) dp[j] |= tmp[j];
  }
  cout << (dp[0] ? "YES\n" : "NO\n");
}
