#include <bits/stdc++.h>
using namespace std;
inline int setBit(int N, int pos) { return N = N | (1 << pos); }
inline int resetBit(int N, int pos) { return N = N & ~(1 << pos); }
inline bool checkBit(int N, int pos) { return (bool)(N & (1 << pos)); }
int notPrime[1000000 + 10];
vector<int> v, prime;
void sieve() {
  for (int i = 2; i <= 1000000; i++) {
    if (notPrime[i] == 0) {
      prime.push_back(i);
      for (int j = i + i; j <= 1000000; j += i) notPrime[j] = 1;
    }
  }
}
int nd[1000000 + 10];
int main() {
  long long i, j, cs, t, d;
  long long n, k, lcm = 1;
  sieve();
  scanf("%lld %lld", &n, &k);
  long long bla = k;
  for (i = 0; i < prime.size(); i++) {
    int cnt = 0;
    while (k % prime[i] == 0) {
      cnt++;
      k /= prime[i];
    }
    nd[i] = cnt;
    if (cnt) v.push_back(i);
  }
  int ok = 0;
  k = bla;
  for (i = 1; i <= n; i++) {
    scanf("%lld", &t);
    for (j = 0; j < v.size(); j++) {
      int p = prime[v[j]];
      int cnt = 0;
      while (t % p == 0) {
        cnt++;
        t /= p;
      }
      if (nd[v[j]] <= cnt) ok++, nd[v[j]] = 1000000;
    }
  }
  if (ok == v.size())
    printf("Yes\n");
  else
    printf("No\n");
  return 0;
}
