#include <bits/stdc++.h>
using namespace std;
long long int a[1000001];
long long int n, m;
long long int dp[1000][1000];
long long int modulosum(long long int index, long long int sum) {
  if (sum != 0 && sum % m == 0) return 1;
  if (index == n) return 0;
  if (dp[index][sum % m] != -1) return dp[index][sum % m];
  dp[index][sum % m] =
      max(modulosum(index + 1, a[index] + sum), modulosum(index + 1, sum));
  return dp[index][sum % m];
}
int main() {
  cin >> n >> m;
  long long int f = 0;
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] == 0) f = 1;
  }
  if (f == 1 || n > m) {
    cout << "YES" << endl;
    return 0;
  }
  memset(dp, -1, sizeof(dp));
  long long int res = modulosum(0, 0);
  if (res == 1)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
