#include <bits/stdc++.h>
using namespace std;
long long solve() {
  int n, m;
  cin >> n >> m;
  const int N = 1e3 + 2;
  vector<int> a(N);
  if (n > m) return cout << "YES\n", 0;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    a[i] %= m;
  }
  int dp[N][N];
  memset(dp, 0, sizeof(dp));
  for (int i = 1; i <= n; i++) dp[i][a[i]] = 1;
  for (int i = 2; i <= n; i++) {
    for (int j = 0; j < m; j++) {
      dp[i][j] |= dp[i - 1][j];
      dp[i][j] |= dp[i - 1][(j - a[i] + m) % m];
    }
  }
  cout << (dp[n][0] ? "YES" : "NO") << "\n";
  return 0;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  solve();
  return 0;
}
