#include <bits/stdc++.h>
const int mod = 1000000007;
using namespace std;
map<vector<long long>, int> mp;
long long flag = 0, n, m;
void findAns(vector<long long> &ar, long long index, long long sum) {
  if (flag == 1 || mp[{index, sum}] == 1 || index == n) return;
  mp[{index, sum}] = 1;
  long long sum1 = (sum + ar[index]) % m;
  if (sum1 % m == 0) {
    flag = 1;
    return;
  }
  findAns(ar, index + 1, sum1);
  findAns(ar, index + 1, sum);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  vector<long long> ar(n);
  for (long long i = 0; i < n; i++) {
    cin >> ar[i];
    ar[i] %= m;
    if (ar[i] == 0) flag = 1;
  }
  findAns(ar, 0, 0);
  if (flag)
    cout << "YES";
  else
    cout << "NO";
  return 0;
}
