#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e3 + 5;
const int mod = 1e9 + 7;
const double eps = 1e-9;
int ca = 1;
int n, m;
int ans[maxn], ma[maxn];
;
int a;
void solve() {
  scanf("%d%d", &n, &m);
  while (n--) {
    memset(ma, 0, sizeof(ma));
    ;
    scanf("%d", &a);
    ma[a % m] = 1;
    for (int i = 0; i < m; i++) {
      if (ans[0]) break;
      if (ans[i]) ma[(a % m + i) % m] = 1;
    }
    for (int i = 0; i < m; i++)
      if (!ans[i]) ans[i] = ma[i];
  }
  puts(ans[0] == 1 ? "YES" : "NO");
}
int main() {
  int t;
  solve();
  return 0;
}
