#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
const int M = 1e3 + 10;
int n, m, a[N];
bool dp[M][M];
bool solve() {
  if (n > m) {
    return true;
  }
  for (int i = 0; i < n; ++i) {
    dp[i + 1][a[i] % m] = true;
  }
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      if (dp[i][j]) {
        dp[i + 1][j] = dp[i + 1][(j + a[i]) % m] = true;
      }
    }
  }
  return dp[n][0];
}
void solveTest() {
  cin >> n >> m;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  cout << (solve() ? "YES" : "NO");
}
int main() {
  ios_base::sync_with_stdio(false);
  solveTest();
  return 0;
}
