#include <bits/stdc++.h>
using namespace std;
inline void fast_and_furious() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
}
int n, m, a[1001], dp[1001][1001];
inline void solve() {
  cin >> n >> m;
  if (n > m) {
    cout << "YES";
    exit(0);
  }
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  dp[0][a[0] % m] = 1;
  for (int i = 1; i < n; i++) {
    dp[i][a[i] % m] = 1;
    for (int j = 0; j < m; j++)
      if (dp[i - 1][j]) dp[i][j] = dp[i][(j + a[i]) % m] = 1;
  }
  cout << (dp[n - 1][0] ? "YES" : "NO");
}
int main() {
  fast_and_furious();
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
