#include <bits/stdc++.h>
using namespace std;
const int Maxn = 1000 * 1000 + 10, Maxm = 1000 + 10;
bool dp[Maxm][Maxm];
int arr[Maxn];
int main() {
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
  if (n >= m) {
    cout << "YES";
    return 0;
  }
  dp[0][(arr[0] % m)] = true;
  for (int i = 1; i < n; i++) {
    dp[i][arr[i] % m] = true;
    for (int j = 0; j < m; j++)
      if (dp[i - 1][j]) dp[i][j] = dp[i][(j + arr[i]) % m] = true;
  }
  if (dp[n - 1][0]) {
    cout << "YES";
    return 0;
  }
  cout << "NO";
  return 0;
}
