#include <atcoder/segtree.hpp>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
#define ll long long
#define all(x) x.begin(),x.end()
#define ar array
#define sz(x) ((int)x.size())
#define lazycalc S, op, e, F, mapping, composition, id
#define segcalc S, op, e
template <class T,class S> inline bool chmin(T &a,const S &b) {return (a> b? a= b, 1: 0);}
template <class T,class S> inline bool chmax(T &a,const S &b) {return (a< b? a= b, 1: 0);}
using S = ll;

S op(S a, S b){
    return a ^ b;
}
S e(){ return 0; }
int main(){
    ios_base::sync_with_stdio(false),cin.tie(0);
    ll n, x;
    cin >> n >> x;
    vector <ll> arr(n);
    for(auto &ele: arr) cin >> ele;
    segtree <segcalc> seg(arr);

    bool ok = false;
    for(int i = 0;i < n;i++){
        for(int j = i + 1;j < n;j++){
            if(seg.prod(i, j) == x) ok = true;
        }
    }

    cout << (ok ? "Yes" : "No") << "\n";

    return 0;
}