#include <bits/stdc++.h>
using namespace std;
long long arr[1000006];
bool dp[1003][1003];
int main() {
  long long i, j, k, l, m, n, o;
  long long testcase;
  long long input, flag, tag, ans;
  scanf("%lld", &n);
  scanf("%lld", &m);
  for (long long cs = 1; cs <= n; cs++) {
    scanf("%lld", &arr[cs]);
    arr[cs] %= m;
  }
  if (n >= m) {
    cout << "YES" << endl;
    return 0;
  }
  memset(dp, false, sizeof(dp));
  for (i = 0; i <= n; i++) {
    dp[i][0] = true;
  }
  for (i = 1; i <= n; i++) {
    for (j = 0; j <= m; j++) {
      if (dp[i - 1][j] || dp[i - 1][(j + arr[i]) % m]) {
        dp[i][j] = true;
      }
    }
  }
  if (dp[n][m] == true) {
    cout << "YES" << endl;
  } else {
    cout << "NO" << endl;
  }
}
