#include <bits/stdc++.h>
using namespace std;
const int N = 1000004;
int a[N];
int spf[N], prime[N];
int cntp[N];
void sieve() {
  int i, j;
  for (i = 2; i < N; i++) {
    if (!prime[i]) {
      for (j = 1; 1LL * i * j < N; j++) {
        prime[i * j] = 1;
        if (!spf[i * j]) spf[i * j] = i;
      }
    }
  }
}
int main() {
  int n, k;
  scanf("%d %d", &n, &k);
  int i;
  sieve();
  for (i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (i = 1; i <= n; i++) {
    int val = a[i];
    while (val > 1) {
      int sf = spf[val], cnt = 0;
      while (val % sf == 0) {
        val = val / sf;
        cnt++;
      }
      cntp[sf] = max(cntp[sf], cnt);
    }
  }
  while (k > 1) {
    int sf = spf[k], cnt = 0;
    while (k % sf == 0) {
      k = k / sf;
      cnt++;
    }
    if (cnt > cntp[sf]) {
      printf("No\n");
      return 0;
    }
  }
  printf("Yes\n");
  return 0;
}
