#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000000 + 10;
const int maxm = 1000 + 10;
int presum[maxn];
bool can[maxm][maxm];
int myhash[maxm];
int a[maxn];
int n, m;
int main() {
  scanf("%d %d", &n, &m);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    a[i] %= m;
  }
  if (n > m) {
    presum[0] = a[0];
    myhash[presum[0]]++;
    for (int i = 1; i < n; i++) {
      presum[i] = (presum[i - 1] + a[i]) % m;
      myhash[presum[i]]++;
      if (myhash[presum[i]] == 2) {
        puts("YES");
        return 0;
      }
    }
    puts("NO");
    return 0;
  } else {
    can[0][a[0]] = true;
    can[0][0] = true;
    if (a[0] == 0) {
      puts("YES");
      return 0;
    }
    for (int i = 1; i < n; i++) {
      for (int r = 0; r < m; r++) {
        if (can[i - 1][r]) {
          if ((r + a[i]) % m == 0) {
            puts("YES");
            return 0;
          }
          can[i][r] = true;
          can[i][(r + a[i]) % m] = true;
        }
      }
    }
    puts("NO");
    return 0;
  }
  return 0;
}
