#include <iostream>
#include <string>
#include <vector>
#include <numeric>
#include <map>
#include <algorithm>
#include <set>
#include <queue>
#include <random>
using namespace std;

#define rep(i,m,n) for(int i=m; i<n; i++)
#define INF (1 << 30)

using ll = long long;
using ull = unsigned long long;

std::random_device rng;

//test

//erase leaves: std::iota, union_find
//swapping puzzle: std::next_permutation
//festival: lower_bound

int main()
{
    int n, k;
    cin >> n >> k;
    int ans = 0;
    rep(i, 0, n) {
        int a;
        cin >> a;
        ans ^= (a % (k + 1));
    }

    if (0 < ans) {
        cout << "YES" << endl;
    }
    else {
        cout << "NO" << endl;
    }

    return 0;
}