#include<bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define vvi vector<vi>
#define vs vector<string>
#define pb push_back
#define P pair<int,int>
#define vp vector<P>
#define PP pair<int,P>
#define vpp vector<PP>
#define fi first
#define se second
#define INF 1e9
#define MOD 1000000007
#define REP(i,n) for(int i=0;i<n;i++)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define all(x) (x).begin(),(x).end()
int k;
int dp[1000001];
int grundy(int x){
    if(x==0){
        return dp[0]=0;
    }
    return dp[x]=(grundy(x-1)+1)%(k+1);
}
int main(){
    int n;
    cin>>n>>k;
    vi vec(n);
    REP(i,n){
        cin>>vec[i];
    }
    REP(i,1000001){
        dp[i]=-1;
    }
    grundy(*max_element(all(vec)));
    int ans=0;
    REP(i,n){
        ans^=dp[vec[i]];
    }
    if(ans!=0){
        cout<<"YES"<<endl;
    }else{
        cout<<"NO"<<endl;
    }
    return 0;
}