#include <bits/stdc++.h>
using namespace std;
int arr[1000005];
int lcm[1000005];
void sieve() {
  for (int i = 2; i < 1002; i++) {
    if (arr[i] == 0) {
      for (int j = i; j < 1000005; j += i) {
        arr[j] = i;
      }
    }
  }
  for (int i = 1; i < 1000005; i++)
    if (arr[i] == 0) arr[i] = i;
  return;
}
int main() {
  int n, k, count, temp;
  sieve();
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    scanf("%d", &temp);
    while (temp > 1) {
      count = 0;
      int div = arr[temp];
      while (temp % div == 0) {
        temp /= div;
        count++;
      }
      lcm[div] = max(lcm[div], count);
    }
  }
  while (k > 1) {
    lcm[arr[k]]--;
    if (lcm[arr[k]] < 0) {
      cout << "No" << endl;
      return 0;
    }
    k /= arr[k];
  }
  cout << "Yes" << endl;
  return 0;
}
