#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2020;
int a[MAXN], dp[MAXN][MAXN], n, m;
bool flag;
int main(int argc, char const *argv[]) {
  scanf("%d%d", &n, &m);
  if (n >= m) {
    for (int i = 0; i < n; ++i) scanf("%d", &m);
    printf("YES\n");
    return 0;
  }
  for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
  for (int i = 0; i < n; ++i) {
    if (!i)
      dp[0][(a[i] % m)] = 1;
    else {
      dp[i][(a[i] % m)] = 1;
      for (int j = 0; j < m; ++j)
        if (dp[i - 1][j]) {
          dp[i][(j + a[i]) % m] = 1;
          dp[i][j] = dp[i - 1][j];
        }
    }
  }
  for (int i = 0; i < n; ++i)
    if (dp[i][0]) {
      flag = true;
      break;
    }
  if (flag)
    printf("YES\n");
  else
    printf("NO\n");
  return 0;
}
