#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int main(){
  int N; cin >> N;
  ll H; cin >> H;
  vector<ll> A(N); rep(i,N) cin >> A[i];
  rep(i,N){
    A[i] = abs(A[i]);
    if(A[i]==0){
      cout << "YES" << endl;
      return 0;
    }
  }
  multiset<ll> primes;
  ll tmp = H;
  for(ll i=2;i*i<=tmp; i++){
    while(tmp%i==0){
      primes.insert(i); tmp/=i;
    }
    if(tmp==1) break;
  }
  if(tmp!=1) primes.insert(tmp);
  rep(i,N){
    multiset<ll> del;
    for(auto p:primes){
      if(A[i]%p==0){
        A[i]/=p;
        del.insert(p);
      }
    }
    for(auto d:del) primes.erase(primes.find(d));
  }
  if(primes.empty()) cout << "YES" << endl;
  else cout << "NO" << endl;
  return 0;
}