#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define RT return
#define vv(a,b,c,d) vector<vector<a> >(b,vector<a>(c,d))
#define vvv(a,b,c,d,e) vector<vector<vector<a> > >(b,vv(a,c,d,e))
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;

int N, K;

void test() {
    int a = 1000;
    int k = 1;
    vi g(a + 1);
    for (int i = 1; i <= a; ++i) {
        set<int> S;
        for (int j = max(0, i - k); j < i; ++j) {
            S.insert(g[j]);
        }
        while (S.count(g[i]))g[i]++;
        cout << g[i] << endl;
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(20);

    cin >> N >> K;
    vi A(N);
    int grundy = 0;
    rep(i, N) {
        cin >> A[i];
        grundy ^= A[i] % (K + 1);
    }
    cout << (grundy ? "YES" : "NO") << endl;
}