#include <bits/stdc++.h>
int main() {
  int n, m;
  std::scanf("%d%d", &n, &m);
  std::vector<int> counts(m);
  for (int a; scanf("%d", &a) == 1; ++counts[a % m])
    ;
  for (int i = 0; i < m; ++i)
    for (int j = 1; j <= counts[i]; ++j)
      if (i * j % m == 0) return printf("YES\n"), 0;
  std::vector<bool> ok(m);
  for (int i = 0; i < m; ++i) {
    auto new_ok = ok;
    for (int j = 0; j < m; ++j)
      if (j == 0 || ok[j])
        for (int k = 1; k <= counts[i]; ++k) new_ok[(j + k * i) % m] = true;
    ok = std::move(new_ok);
    if (ok[0]) return printf("YES\n", 0), 0;
  }
  printf("NO\n");
}
