#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1000000 + 10;
long long n, k, a, prime[MAX_N];
vector<long long> p;
int mark[MAX_N];
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> k;
  for (int i = 2; i <= k; i++)
    if (prime[i] == 0) {
      long long x = i;
      while (k % (x * i) == 0) {
        x *= i;
      }
      if (k % x == 0) {
        p.push_back(x);
      }
      for (int j = 2; j * i <= k; j++) {
        prime[i * j] = 1;
      }
    }
  for (int i = 1; i <= n; i++) {
    cin >> a;
    for (int j = 0; j < p.size(); j++) {
      if (a % p[j] == 0) {
        mark[j] = 1;
      }
    }
  }
  for (int j = 0; j < p.size(); j++) {
    if (mark[j] == 0) {
      cout << "No" << endl;
      return 0;
    }
  }
  cout << "Yes" << endl;
}
