#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1e6 + 10;
int n, k;
int c[MAX_N];
int used[MAX_N];
int mgcd(int aa, int bb) {
  int cc;
  while (bb) {
    cc = bb;
    bb = aa % bb;
    aa = cc;
  }
  return aa;
}
int main() {
  int i, x, y, p = 1;
  scanf("%d%d", &n, &k);
  for (i = 1; i <= n; i++) {
    scanf("%d", &c[i]);
    if (used[c[i]]) continue;
    used[c[i]] = 1;
    x = mgcd(c[i], k);
    y = mgcd(p, x);
    x /= y;
    p *= x;
  }
  if (p >= k)
    printf("Yes\n");
  else
    printf("No\n");
  return 0;
}
