#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 100;
int f[N];
map<int, int> m;
int k;
int n;
int arr[N];
void in(int t) {
  int v = t;
  while (t != 1) {
    int x = f[t];
    int cnt = 0;
    while (t % x == 0) {
      t /= x, cnt++;
    }
    if (v != k) {
      if (m.count(x) > 0)
        if (cnt >= m[x]) m[x] = 0;
    } else if (v == k) {
      m[x] = cnt;
    }
  }
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  memset(f, -1, sizeof(f));
  f[0] = f[1] = 1;
  for (int i = 2; i <= N - 100; i++) {
    for (int j = 1; i * j <= N - 100; j++) {
      if (f[i * j] == -1) f[i * j] = i;
    }
  }
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> arr[i];
  }
  in(k);
  for (int i = 1; i <= n; i++) {
    if (arr[i] == k) {
      cout << "YES";
      return 0;
    } else
      in(arr[i]);
  }
  for (map<int, int>::iterator it = m.begin(); it != m.end(); it++) {
    if (it->second != 0) {
      cout << "NO";
      return 0;
    }
  }
  cout << "YES";
}
