#include <bits/stdc++.h>
using namespace std;
const int MOD(1000000007);
const int INF((1 << 30) - 1);
const int MAXN(2005);
int dp[MAXN];
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n; i++) {
    int x;
    scanf("%d", &x);
    x %= m;
    for (int j = 2 * m - 1; j >= 0; j--) {
      if (j - x >= 0) {
        dp[j] |= dp[j - x];
      }
    }
    dp[x] = 1;
    for (int j = 0; j < m; j++) dp[j] |= dp[j + m];
    for (int j = m; j <= 2 * m - 1; j++) dp[j] = 0;
    if (dp[0]) {
      printf("YES");
      return 0;
    }
  }
  printf("NO");
}
