#include using namespace std; // @formatter:off using ll = long long; using P = pair; using Graph = vector>; #define rep(i, n) for(ll i=0;i<(ll)(n);i++) #define rep2(i, m, n) for(ll i=m;i<(ll)(n);i++) #define rrep(i, n, m) for(ll i=n;i>=(ll)(m);i--) const int dx[4] = {1, 0, -1, 0}; const int dy[4] = {0, 1, 0, -1}; const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1}; const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1}; const ll MOD = 1000000007; const ll INF = 1000000000000000000L; template bool chmax(T &a, const T &b) {if (a < b){a = b;return true;}else{return false;}} template bool chmin(T &a, const T &b) {if (a > b){a = b;return true;}else{ return false;}} #ifdef __DEBUG /** * For DEBUG * https://github.com/ta7uw/cpp-pyprint */ #include "cpp-pyprint/pyprint.h" #else #define print(...) #endif // @formatter:on void solve() { ll N, K; cin >> N >> K; vector A(N); rep(i, N) cin >> A[i]; ll v = 0; K++; rep(i, N) { ll a = A[i]; v ^= a % K; } if (v == 0) { cout << "NO" << '\n'; } else { cout << "YES" << '\n'; } } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); solve(); return 0; }