#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const int N = 1e6 + 5;
vector<int> primes;
void trival_prime(int r) {
  for (int i = (2); i < (r + 1); i++) {
    bool ok = true;
    for (auto d : primes) {
      if (d * d > i) break;
      if (i % d == 0) {
        ok = false;
        break;
      }
    }
    if (ok) primes.push_back(i);
  }
}
vector<int> factor(int n) {
  vector<int> ans;
  for (auto d : primes) {
    if (d * d > n) break;
    while (n % d == 0) {
      ans.push_back(d);
      n /= d;
    }
  }
  if (n > 1) ans.push_back(n);
  return ans;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  vector<int> c(n);
  for (int i = (0); i < (n); i++) cin >> c[i];
  map<int, int> cfact, kfact;
  trival_prime(N);
  vector<int> kf = factor(k);
  for (auto d : kf) kfact[d]++;
  bool ok = true;
  for (auto [prime, times] : kfact) {
    int v = 1;
    for (int i = (0); i < (times); i++) v *= prime;
    bool flag = false;
    for (int i = (0); i < (n); i++) {
      if (c[i] % v == 0) {
        flag = true;
        break;
      }
    }
    if (!flag) {
      ok = false;
      break;
    }
  }
  if (ok)
    cout << "YES";
  else
    cout << "NO";
  return 0;
}
