#include <bits/stdc++.h>
using namespace std;
void zanj0() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
unordered_map<int, int> cnt;
const int N = 1e6 + 5;
int seive[N];
void pre() {
  for (int i = 1; i < N; i++) seive[i] = i;
  for (int i = 2; i * i < N; i++) {
    if (seive[i] == i) {
      for (int j = i * i; j < N; j += i) {
        seive[j] = i;
      }
    }
  }
}
void getFact(int num) {
  unordered_map<int, int> temp;
  while (num > 1) {
    int div = seive[num];
    temp[div]++;
    num /= div;
  }
  for (auto& it : temp) {
    cnt[it.first] = max(cnt[it.first], it.second);
  }
}
void solve() {
  pre();
  int n, k;
  cin >> n >> k;
  int x;
  for (int i = 0; i < n; i++) {
    cin >> x;
    getFact(x);
  }
  for (auto& it : cnt) {
    while (k > 1 && k % it.first == 0 && it.second) {
      it.second--;
      k /= it.first;
    }
  }
  cout << (k == 1 ? "YES" : "NO") << "\n";
}
int32_t main() {
  zanj0();
  solve();
  cerr << "Time : " << 1000 * (long double)clock() / (long double)CLOCKS_PER_SEC
       << "ms\n";
  return 0;
}
