#include <bits/stdc++.h>
using namespace std;
vector<vector<long long int>> dp(1001, vector<long long int>(2010, -1));
bool check(long long int i, long long int k, long long int sum,
           vector<long long int>& a) {
  if (i == -1) {
    if ((sum) == 0)
      return true;
    else
      return false;
  }
  if (sum != -1 && dp[i][sum] != -1) return dp[i][sum];
  if (sum == -1 && dp[i][sum + k + 5] != -1) return dp[i][sum + k + 5];
  if (sum == 0) return dp[i][sum] = 1;
  int now;
  if (sum == -1) {
    now = a[i] % k;
  } else
    now = (sum + a[i]) % k;
  if (sum != -1)
    return dp[i][sum] = check(i - 1, k, now, a) || check(i - 1, k, sum, a);
  else
    return dp[i][sum + k + 5] =
               check(i - 1, k, now, a) || check(i - 1, k, sum, a);
}
void solve() {
  long long int n, k;
  cin >> n >> k;
  long long int sum = 0;
  vector<long long int> a(n);
  for (long long int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++) sum += a[i];
  for (int i = 0; i < n; i++) {
    if (a[i] == 0) {
      cout << "YES" << endl;
      return;
    }
  }
  if (sum % k == 0) {
    cout << "YES" << endl;
    return;
  }
  if (n > k) {
    cout << "YES" << endl;
    return;
  }
  if (check(n - 1, k, -1, a)) {
    cout << "YES" << endl;
    return;
  } else
    cout << "NO" << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int t = 1;
  while (t-- > 0) {
    solve();
  }
}
