#include <bits/stdc++.h>
using namespace std;
long long int arr[1000005], dp[1005][1005];
long long int n, m;
bool fun(bool isTaken, long long int pos, long long int sumMod) {
  if (pos == n) {
    return (sumMod == 0 && isTaken == true);
  }
  long long int &ret = dp[pos][sumMod];
  if (ret != -1) return ret;
  ret = 0;
  return ret = fun(isTaken | true, pos + 1, (sumMod + arr[pos]) % m) |
               fun(isTaken | false, pos + 1, sumMod);
}
int main() {
  {
    scanf("%lld", &n);
    ;
    scanf("%lld", &m);
    ;
    for (long long int i = 0; i <= n - 1; i++) {
      scanf("%lld", &arr[i]);
      ;
    }
    if (n > m) {
      printf("YES\n");
    } else {
      memset(dp, -1, sizeof(dp));
      if (fun(0, 0, 0))
        printf("YES\n");
      else
        printf("NO\n");
    }
  }
  fclose(stdin);
  fclose(stdout);
}
