#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
int main(){
    ll n,h;cin >> n >>h;
    vpl fac;
    ll z=h;
    repl(i,2,sqrt(h)+10){
        if(z%i==0){
            ll ret=0;
            while(z%i==0){
                ret++;z/=i;
            }
            fac.pb({i,ret});
        }
    }
    if(z!=1)fac.pb({z,1});
    vector<ll> ans(fac.size());
    bool t=true;
    rep(i,n){
        ll a;cin >> a;
        if(a==0)cout << "YES" <<endl,exit(0);
        if(a<0)a=-a;
        rep(j,fac.size()){
            while(a%fac[j].fi==0){
                ans[j]++;a/=fac[j].fi;
            }
        }
    }
    rep(i,fac.size()){
        if(ans[i]<fac[i].se)t=false;
    }
    if(t)cout << "YES" <<endl;
    else cout << "NO" <<endl;
}