#include <bits/stdc++.h>
using namespace std;
const int maxN = (int)1E6 + 6;
int n, k, m;
bool avail[maxN];
int a[maxN];
set<int> f, g;
long long GCD(long long x, long long y) {
  if (x < y) return GCD(y, x);
  if (y == 0) return x;
  return GCD(y, x % y);
}
long long LCM(long long x, long long y) { return (x / GCD(x, y)) * y; }
int main() {
  scanf("%d %d", &n, &k);
  memset(avail, false, sizeof(avail));
  for (int i = 1; i <= n; ++i) {
    int c;
    scanf("%d", &c);
    avail[c] = true;
  }
  m = 0;
  for (int i = 1; i <= sqrt(k); ++i) {
    if (k % i == 0) {
      bool ok = false;
      for (int j = i; j < maxN; j += i)
        if (avail[j]) {
          ok = true;
          break;
        }
      if (ok) a[++m] = i;
      ok = false;
      for (int j = k / i; j < maxN; j += (k / i))
        if (avail[j]) {
          ok = true;
          break;
        }
      if (ok) a[++m] = k / i;
    }
  }
  f.clear();
  f.insert(1);
  for (int i = 2; i <= m; ++i) {
    g.clear();
    long long j = a[i];
    for (set<int>::iterator it = f.begin(); it != f.end(); ++it) {
      if (LCM(j, (*it)) <= k && k % LCM(j, (*it)) == 0 &&
          f.find(j * (*it)) == f.end() && g.find(j * (*it)) == g.end())
        g.insert(LCM(j, (*it)));
    }
    for (set<int>::iterator it = g.begin(); it != g.end(); ++it) f.insert(*it);
  }
  if (f.find(k) != f.end())
    puts("Yes");
  else
    puts("No");
  return 0;
}
