#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

vector<pair<int,int>> factorize(ll x){
  vector<pair<int,int>> res;
  for(ll i=2;i*i<=x;i++){
    int num=0;
    while(x%i==0){
      num++;
      x/=i;
    }
    if(num) res.push_back(mkp(i,num));
  }
  if(x>1) res.push_back(mkp(x,1));
  return res;
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N,H;
  cin>>N>>H;
  vector<int> A(N);
  rep(i,N) cin>>A[i];

  rep(i,N){
    if(A[i]==0){
      cout<<"YES"<<endl;
      return 0;
    }
  }

  auto primes=factorize(H);
  for(int i=0;i<N;i++){
    A[i]=abs(A[i]);
    for(auto &e:primes){
      int val=e.first;
      while(A[i]%val==0){
        A[i]/=val;
        e.second--;
      }
    }
  }

  for(auto e:primes){
    if(e.second>0){
      cout<<"NO"<<endl;
      return 0;
    }
  }
  cout<<"YES"<<endl;

  return 0;
}