#include using namespace std; //#define int long long #define REP(i,m,n) for(int i=(m);i<(n);i++) #define rep(i,n) REP(i,0,n) #define pb push_back #define all(a) a.begin(),a.end() #define rall(c) (c).rbegin(),(c).rend() #define mp make_pair #define endl '\n' #define vec vector #define mat vector > #define fi first #define se second #define double long double typedef long long ll; typedef unsigned long long ull; typedef pair pll; //typedef long double ld; typedef complex Complex; const ll INF=1e9+7; const ll MOD=998244353; const ll inf=INF*INF; const ll mod=MOD; const ll MAX=2000010; signed main(){ ll n,k;cin>>n>>k; vectora(n); rep(i,n)cin>>a[i]; setst; ll x=0; st.insert(0); bool f=0; rep(i,n){ x^=a[i]; if(st.find(x^k)!=st.end()){ f=1; } st.insert(x); } cout<<(f?"Yes":"No")<