#include <bits/stdc++.h>
using namespace std;
long long dp[55555], b[1000005], d[5555555];
int main() {
  int n, m;
  cin >> n >> m;
  int a[n + 123];
  int sum = 0;
  if (n > m) return cout << "YES", 0;
  for (int i = 1; i <= n; i++) {
    cin >> a[i], a[i] = a[i] % m, dp[a[i]]++;
    for (int j = 0; j < m; j++)
      if (d[j] != 0) dp[(j + a[i]) % m]++;
    for (int j = 0; j < m; j++) d[j] += dp[j];
    if (dp[0] > 0) return cout << "YES", 0;
  }
  cout << "NO";
  return 0;
}
