#include <bits/stdc++.h>
using namespace std;
const long long A = 100000000000000LL, N = 1020;
int dp[2][N], a[N * N], i, j, n, m;
int main() {
  cin >> n >> m;
  for (i = 0; i < n; i++) scanf("%d", &a[i]), a[i] %= m;
  dp[0][0] = 1;
  for (i = 0; i < n; i++) {
    for (j = 0; j < m; j++)
      if (dp[0][j]) dp[1][(j + a[i]) % m] = 1;
    if (dp[1][0]) {
      puts("YES");
      return 0;
      ;
    }
    for (j = 0; j < m; j++) dp[0][j] = max(dp[0][j], dp[1][j]), dp[1][j] = 0;
  }
  puts("NO");
}
