#include <bits/stdc++.h>
using namespace std;
int n, m;
int arr[1000001] = {0};
int mem[1001][1001];
int solve(int i, int mod, int flag) {
  if (i == n) {
    return (mod == 0) * flag;
  }
  int &ret = mem[i][mod];
  if (ret != -1) {
    return ret;
  }
  return ret = solve(i + 1, (arr[i] + mod) % m, 1) || solve(i + 1, mod, flag);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
  }
  if (n > m) {
    cout << "YES";
    return 0;
  }
  memset(mem, -1, sizeof(mem));
  int k = solve(0, 0, 0);
  if (k) {
    cout << "YES";
  } else {
    cout << "NO";
  }
  return 0;
}
