#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)

vector<pair<ll,int>>factorize(ll n){
    vector<pair<ll,int>>res;
    for(ll i=2;i*i<=n;++i){
        if(n%i)continue;
        res.emplace_back(i,0);
        while(n%i==0){
            n/=i;
            res.back().second++;
        }
    }
    if(n!=1)res.emplace_back(n,1);
    return res;
}
int main(){
    ll n,h;
    cin>>n>>h;
    auto f=factorize(h);
    vector<ll>x;
    for(auto p:f){
      rep(i,p.second)x.push_back(p.first);
    }
    rep(i,n){
      ll a;
      cin>>a;
      for(int j=x.size()-1;j>=0;j--){
        if(a%x[j]==0)x[j]=1;
      }
    }
    bool hantei=true;
    rep(i,x.size()){
      if(x[i]!=1){
        hantei=false;
        break;
      }
    }
    if(hantei)cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
    return 0;
}