#include <bits/stdc++.h>
using namespace std;
int dp[1001];
int n, m, a[1000001];
int main() {
  cin >> n >> m;
  if (n >= m) {
    cout << "YES" << endl;
    return 0;
  }
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    a[i] %= m;
  }
  for (int i = 1; i <= n; i++) {
    if (dp[a[i]] == 0) dp[a[i]] = i;
    for (int j = 0; j < m; j++) {
      if (dp[j] > 0 && dp[j] < i && dp[(j + a[i]) % m] == 0) {
        dp[(j + a[i]) % m] = i;
      }
    }
  }
  if (dp[0]) {
    cout << "YES" << endl;
  } else
    cout << "NO" << endl;
}
