#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1e18;
const int inf = 1e9;
const long long int MOD = 1e9 + 7;
const int nax = 1000000 + 10;
;
int arr[nax], dp[1001][1001], m;
bool solve(int n, int sum) {
  if (n == 0) return false;
  if (dp[n][sum % m] != -1) return dp[n][sum % m];
  if ((arr[n] + (sum % m)) % m == 0) return dp[n][sum % m] = true;
  bool flag = solve(n - 1, sum % m);
  flag |= solve(n - 1, (arr[n] % m + sum) % m);
  return dp[n][sum % m] = flag;
}
int main() {
  ios::sync_with_stdio(0);
  int n;
  cin >> n >> m;
  for (int i = 1; i <= n; i++) cin >> arr[i];
  if (n > m) {
    cout << "YES";
    return 0;
  }
  for (int i = 0; i <= n; i++) {
    for (int j = 0; j <= m; j++) dp[i][j] = -1;
  }
  if (solve(n, 0))
    cout << "YES";
  else
    cout << "NO";
  return 0;
}
