#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1e9;
const int mod = (int)1e9 + 7;
const int MAX = (int)1e6 + 5;
long long store[MAX];
int dp[1005][1005];
int main(void) {
  int n, m;
  scanf("%d %d", &n, &m);
  for (int i = (1); i < (n + 1); ++i) scanf("%lld", store + i);
  if (n > m)
    puts("YES");
  else {
    dp[1][store[1] % m] = 1;
    for (int i = (2); i < (n + 1); ++i) {
      dp[i][store[i] % m] = 1;
      for (int j = 0; j < (m); ++j)
        if (dp[i - 1][j]) {
          dp[i][j] = 1;
          dp[i][(j + store[i] % m) % m] = 1;
        }
    }
    for (int i = (1); i < (n + 1); ++i)
      if (dp[i][0]) {
        puts("YES");
        return 0;
      }
    puts("NO");
  }
  return 0;
}
