#include <bits/stdc++.h>
using namespace std;
int n, k, c;
bool prime[1000010 + 5];
vector<int> p;
vector<pair<int, bool>> v;
void criba() {
  p.push_back(2);
  for (int i = 3; i < 1000010; i += 2)
    if (!prime[i]) {
      for (int j = i + i; j < 1000010; j += i) prime[j] = true;
      p.push_back(i);
    }
}
int main() {
  criba();
  scanf("%d %d", &n, &k);
  for (int i = 0; i < p.size(); i++) {
    if (k % p[i] == 0) {
      int tmp = 1;
      while (k % p[i] == 0) tmp *= p[i], k /= p[i];
      v.push_back(make_pair(tmp, false));
    }
  }
  for (int i = 0; i < n; i++) {
    scanf("%d", &c);
    for (int j = 0; j < v.size(); j++)
      if (c % v[j].first == 0) v[j].second = true;
  }
  bool ok = true;
  for (int i = 0; i < v.size(); i++)
    if (v[i].second == false) ok = false;
  printf(ok ? "Yes\n" : "No\n");
  return (0);
}
