#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000;
int arr[maxn];
int memo[maxn][maxn];
int n, m;
int dp(int i, int sum) {
  if (sum == 0) return 1;
  if (i == n) return sum == 0;
  int &ref = memo[i][sum];
  if (ref != -1) return ref;
  if (dp(i + 1, sum)) return ref = 1;
  if (dp(i + 1, (sum + arr[i]) % m)) return ref = 1;
  return ref = 0;
}
int main() {
  cin >> n >> m;
  if (n >= m) {
    cout << "YES";
    return 0;
  }
  memset(memo, -1, sizeof(memo));
  for (int i = 0; i < n; i++) cin >> arr[i];
  if (dp(0, m)) {
    cout << "YES";
    return 0;
  }
  cout << "NO";
  return 0;
}
