#include <bits/stdc++.h>
using namespace std;
int crib[1000009];
void criba() {
  for (long long i = 2; i < 1000009; i++) {
    if (crib[i] == 0) {
      for (long long j = i * i; j < 1000009; j += i) {
        crib[j] = i;
      }
    }
  }
}
void factorize(long long n, map<long long, long long> &pf) {
  if (n < 2) return;
  while (crib[n] != 0) {
    pf[crib[n]]++;
    n /= crib[n];
  }
  pf[n]++;
}
void lcm2(vector<long long> &nums, map<long long, long long> &L) {
  L.clear();
  for (int i = 0; i < nums.size(); i++) {
    map<long long, long long> pf;
    factorize(nums[i], pf);
    for (auto it = pf.begin(); it != pf.end(); ++it) {
      if (it->second > L[it->first]) L[it->first] = it->second;
    }
  }
}
int divide(map<long long, long long> &L, long long k) {
  map<long long, long long> pf;
  factorize(k, pf);
  for (const pair<long long, long long> &p : pf) {
    if (p.second > L[p.first]) return 0;
  }
  return 1;
}
void print_pair(pair<long long, long long> num) {
  cout << num.first << " " << num.second;
}
void print_vll(vector<pair<long long, long long> > &v) {
  for (pair<long long, long long> x : v) {
    print_pair(x);
    cout << endl;
  }
}
int main() {
  criba();
  long long n, k;
  cin >> n >> k;
  vector<long long> ar(n);
  for (int i = 0; i < n; i++) {
    int x;
    scanf("%d", &x);
    ar[i] = x;
  }
  map<long long, long long> L;
  lcm2(ar, L);
  if (divide(L, k)) {
    cout << "Yes\n";
  } else {
    cout << "No\n";
  }
  return 0;
}
