#include <bits/stdc++.h>
using namespace std;
const int nmax = 1e6 + 6;
int isprime[nmax];
int highest[nmax];
int n, k;
int sol[nmax];
long long gcd(long long a, long long b) {
  long long r;
  while (b != 0) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
int main() {
  int tmp = 1;
  scanf("%d %d", &n, &k);
  for (int i = 1, c; i <= n; i++) {
    scanf("%d", &c);
    tmp = gcd(lcm(tmp, c), 1LL * k);
  }
  bool ok = tmp == k;
  return 0 * printf("%s\n", (ok ? "Yes" : "No"));
}
