#include <bits/stdc++.h>
using namespace std;
const int SIZE = 1e3 + 10;
const int INF = 0x3f3f3f3f;
const double eps = 1e-5;
const double PI = atan(1.0) * 4.0;
const long long mod = 1e9 + 7;
int n, m;
int a[SIZE * SIZE], t[SIZE][SIZE];
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1, x; i <= n; i++) {
    scanf("%d", &x);
    x = x % m;
    a[i] = x;
    if (!x) {
      puts("YES");
      return 0;
    }
  }
  if (n > m) {
    puts("YES");
    return 0;
  }
  for (int i = 1; i <= n; i++) {
    t[i][a[i]] = 1;
    for (int j = 0; j < m; j++)
      if (t[i - 1][j]) {
        t[i][j] = 1;
        t[i][(j + a[i]) % m] = 1;
      }
  }
  puts(t[n][0] ? "YES" : "NO");
  return 0;
}
