#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[1007 * 1007];
int dp[1007][1007];
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  if (n > m) {
    puts("YES");
    return 0;
  }
  memset(dp, 0, sizeof(dp));
  dp[0][0] = 1;
  bool flag = false;
  for (int i = 1; i <= n; i++)
    for (int j = m - 1; j >= 0; j--) {
      int x = ((j - a[i]) % m + m) % m;
      if (dp[i - 1][x]) {
        dp[i][j] = 1;
        if (j == 0) flag = true;
      }
      if (dp[i - 1][j]) dp[i][j] = 1;
    }
  if (flag)
    puts("YES");
  else
    puts("NO");
}
