#include <bits/stdc++.h>
using namespace std;
int num[1000008];
int dp[1000008];
int n;
int m;
int flag;
int main() {
  cin >> n >> m;
  flag = 0;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &num[i]);
    num[i] %= m;
    if (num[i] == 0) {
      flag = 1;
    }
  }
  memset(dp, 0, sizeof(dp));
  dp[0] = 1;
  if (n >= m || flag) {
    cout << "YES" << endl;
  } else {
    flag = 0;
    for (int j = 1; j <= n; j++) {
      for (int i = n * m; i >= num[j]; i--) {
        dp[i] = max(dp[i], dp[i - num[j]]);
      }
    }
    for (int i = m; i <= n * m; i += m) {
      if (dp[i]) {
        cout << "YES" << endl;
        flag = 1;
        break;
      }
    }
    if (!flag) cout << "NO" << endl;
  }
  return 0;
}
