#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;

int grundy[1000010],Seg[1000010];
set<int> se;

void solve(){
  int n,k;
  cin >> n >> k;
  Seg[0]=1;
  Rep(i,1,1000001){
    se.insert(i);
  }
  Rep(i,1,1000001){
    if(i-k-1>=0){
      Seg[grundy[i-k-1]]--;
      if(Seg[grundy[i-k-1]]==0){
        se.insert(grundy[i-k-1]);
      }
    }
    grundy[i]=*se.begin();
    se.erase(grundy[i]);
    Seg[grundy[i]]+=1;
    
  }
  int ans=0;
  rep(i,n){
    int a;cin >> a;
    ans^=a;
  }
  rep(i,20){
    //cout << i << " " << grundy[i] << endl;
  }
  if(ans==0) cout << "NO" << endl;
  else cout << "YES" << endl;
}

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