#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
long long int lcm(int a, int b) {
  int g = gcd(a, b);
  return (long long int)a / g * b;
}
namespace number_theory {
int primes[1000000 + 5];
int pfac[1000000 + 5];
bool pflag[1000000 + 5];
int p;
void prepare() {
  p = 0;
  for (int i = 2; i <= 1000000; ++i) {
    if (!pflag[i]) {
      primes[p++] = i;
      pfac[i] = i;
    }
    for (int j = 0; j < p && i * primes[j] <= 1000000; ++j) {
      pflag[i * primes[j]] = true;
      pfac[i * primes[j]] = primes[j];
      if (i % primes[j] == 0) break;
    }
  }
}
void factorize(map<int, int>& f, int num) {
  f.clear();
  while (num > 1) {
    ++f[pfac[num]];
    num /= pfac[num];
  }
}
};  // namespace number_theory
int c[1000005];
map<int, int> fac[1000005];
bool vis[105];
int n, k;
int main(int argc, char* argv[]) {
  number_theory::prepare();
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &c[i]);
    number_theory::factorize(fac[i], c[i]);
  }
  map<int, int> kfac;
  map<int, bool> solved;
  number_theory::factorize(kfac, k);
  for (const auto& p : kfac) solved[p.first] = false;
  for (int i = 0; i < n; ++i) {
    for (const auto& p : fac[i]) {
      if (kfac.count(p.first)) {
        if (p.second >= kfac[p.first]) solved[p.first] = true;
      }
    }
  }
  bool ans = true;
  for (const auto& p : solved) {
    if (!p.second) {
      ans = false;
      break;
    }
  }
  if (ans)
    puts("Yes");
  else
    puts("No");
  return 0;
}
