#include <bits/stdc++.h>
using namespace std;
const int SIEVE_LIMIT = 1000001;
int lp[SIEVE_LIMIT + 1];
vector<int> pr;
void linear_sieve() {
  for (int i = 2; i <= SIEVE_LIMIT; i++) {
    if (lp[i] == 0) {
      lp[i] = i;
      pr.push_back(i);
    }
    for (int j = 0;
         j < (int)pr.size() && pr[j] <= lp[i] && i * pr[j] <= SIEVE_LIMIT; ++j)
      lp[i * pr[j]] = pr[j];
  }
}
map<int, int> factors;
bool f[101];
int numbers[101], nn = 0;
vector<pair<int, int> > A;
int a;
int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  linear_sieve();
  while (k != 1) {
    int num = 1;
    int pr = lp[k];
    while (k % pr == 0) {
      num = num * pr;
      k = k / pr;
    }
    numbers[nn++] = num;
  }
  for (int i = 0; i < n; i++) {
    scanf("%d", &a);
    for (int j = 0; j < nn; j++) {
      if (a % numbers[j] == 0) {
        f[j] = true;
      }
    }
  }
  int cc = 0;
  for (int i = 0; i < nn; i++) {
    cc += f[i];
  }
  if (cc == nn) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
  return 0;
}
