#include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("O3")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second

using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;

ll N,M,H,W,Q,K,A,B;
string S;
typedef pair<ll, ll> P;
const ll INF = (1LL<<48);
P extgcd(ll a, ll b, bool gcd = false){
    // return p  :  a * p.fi + b * p.se = gcd(a, b);
    struct eq_elem{
        // ax + by = u
        ll u, x, y;
        eq_elem(ll _a, ll _b, ll _c){
            u = _a; x = _b; y = _c;
        }
        eq_elem& operator *=(const ll &t){
            u *= t; x *= t; y *= t;
            return *this;
        }
        eq_elem operator * (const ll &t){
            return eq_elem(*this) *= t;
        }
        eq_elem& operator -=(const eq_elem &t){
            u -= t.u; x -= t.x; y -= t.y;
            return *this;
        }
        eq_elem operator - (const eq_elem &t){
            return eq_elem(*this) -= t;
        }
    };
    bool flag = a < b;
    if(flag) swap(a, b);
    eq_elem s(a, 1, 0), t(b, 0, 1);
    while(t.u != 0){
        s -= t * (s.u / t.u);
        swap(s, t);
    }
    if(gcd){
        return make_pair(s.u, 0LL);
    }else {
        if(flag) swap(s.x, s.y);
        return make_pair(s.x, s.y);
    }
}
int main() {
    cin>>N>>K;
    vec a(N);
    rep(i, N) {cin>>a[i]; a[i] = abs(a[i]);}
    bool flag(false);
    if(*min_element(ALL(a)) == 0 || K == 1) flag = true;
    rep(i, N){
        K /= extgcd(K, a[i], true).fi;
        if(K == 1) flag = true;
        if(flag) break;
    }
    cout<<(flag ? "YES" : "NO")<<endl;
}