#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const long long infl = 0x3f3f3f3f3f3f3f3fLL;
const int infi = 0x3f3f3f3f;
bool poss[2][1000];
void solve() {
  int n, m;
  cin >> n >> m;
  if (n > m) {
    cout << "YES\n";
    return;
  }
  int i, t, j;
  for (i = 0; i < n; i++) {
    cin >> t;
    poss[1][t % m] = 1;
    for (j = 0; j < m; j++)
      if (poss[0][j] == 1) poss[1][(j + t) % m] = 1;
    for (j = 0; j < m; j++) poss[0][j] = max(poss[1][j], poss[0][j]);
  }
  if (poss[0][0] == 1)
    cout << "YES\n";
  else
    cout << "NO\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
}
