#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000005;
int a[maxn];
int dp1[maxn], dp2[maxn];
int main() {
  int n, m;
  while (~scanf("%d%d", &n, &m)) {
    int flag = 0;
    memset(dp1, 0, sizeof(dp1));
    memset(dp2, 0, sizeof(dp2));
    for (int i = 1; i <= n; i++) {
      scanf("%d", &a[i]);
      if (a[i] == m) flag = 1;
    }
    if (flag) {
      printf("YES\n");
      continue;
    }
    for (int i = 1; i <= n; i++) {
      for (int j = 0; j < m; j++) {
        if (dp1[j]) dp2[(a[i] + j) % m] = 1;
      }
      dp2[a[i] % m] = 1;
      for (int j = 0; j < m; j++) dp1[j] = dp2[j];
      if (dp1[0]) {
        flag = 1;
        break;
      }
    }
    if (flag)
      printf("YES\n");
    else
      printf("NO\n");
  }
}
