#include <bits/stdc++.h>
using namespace std;
vector<int64_t> c;
int64_t n, k;
vector<int64_t> v, primes;
int64_t gcd(int64_t a, int64_t b) { return b ? gcd(b, a % b) : a; }
int64_t lcm(int64_t a, int64_t b) { return (a / gcd(a, b) * b); }
void init() {
  ios_base::sync_with_stdio(false);
  cin >> n >> k;
  c.resize(n);
  for (int64_t i = 0; i < n; ++i) {
    cin >> c[i];
  }
}
void solve() {
  int64_t x = c[0];
  for (int64_t i = 0; i < c.size(); ++i) {
    x = lcm(x, gcd(k, c[i]));
  }
  if (x % k == 0) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
}
int32_t main() {
  init();
  solve();
  return 0;
}
