//#include <atcoder/all>
//using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPR(i, n) for(int i=n-1; i>=0; i--)
#define FOR(i, m, n) for(int i=m; i<n; i++)
#define ALL(v) v.begin(), v.end()
#define SIZE(x) int(x.size()) 
using P = pair<int, int>;
using vvi = vector<vector<int>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = 2e9;
const ll LINF = (1LL<<60);

map<ll, int> prime_factor(ll n) {
  map<ll, int> ret;
  for(ll i = 2; i * i <= n; i++) {
    while(n % i == 0) {
      ret[i]++;
      n /= i;
    }
  }
  if(n != 1) ret[n] = 1;
  return ret;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n,h; cin >> n >> h;
  vector<int> a(n);
  REP(i,n) cin >> a[i];

  auto pfh = prime_factor(h);
  map<ll, int> mp;
  REP(i,n){
    auto pf = prime_factor(a[i]);
    for(auto [num, cnt]: pf) mp[num] += cnt;
  }

  for(auto [num, cnt]: pfh){
    if(mp[num]<cnt){
      cout << "NO\n";
      return 0;
    }
  }
  cout << "YES\n";
  return 0;
}