#include <bits/stdc++.h>
using namespace std;
const long long mxn = 1e6 + 7;
const long long mod = 1e9 + 7;
const long long inf = 1e18 + 7;
int dx[] = {+1, -1, 0, 0};
int dy[] = {0, 0, -1, +1};
int n, m, a[mxn];
int dp[mxn];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    a[i] %= m;
  }
  if (n > m) return cout << "YES", 0;
  for (int i = 1; i <= n; i++) {
    int key[mxn];
    for (int j = 0; j < m; j++) {
      key[j] = dp[j];
    }
    for (int j = 0; j < m; j++) {
      if (key[j]) dp[(j + a[i]) % m] = 1;
    }
    dp[a[i]] = 1;
  }
  if (dp[0])
    cout << "YES";
  else
    cout << "NO";
  return 0;
}
