#include <bits/stdc++.h>
using namespace std;
template <class T>
void maximize(T& x, T y) {
  if (x < y) x = y;
}
template <class T>
void minimize(T& x, T y) {
  if (x > y) x = y;
}
template <typename t>
ostream& operator,(ostream& os, const t& x) {
  return os << ' ' << x;
}
template <class T>
ostream& operator<<(ostream& os, vector<T>& x) {
  for (int i = 0; i < x.size(); i++) os << x[i] << ' ';
  os << '\n';
  return os;
}
vector<int> divisor;
vector<int> a;
int n, k;
bool check[105];
void factorize() {
  for (long long i = 2; i * i <= k; i++) {
    if (k % i == 0) {
      int cur = 1;
      while (k % i == 0) {
        cur *= i;
        k /= i;
      }
      divisor.push_back(cur);
    }
  }
  if (k != 1) divisor.push_back(k);
}
void solve() {
  for (int i = 0; i < a.size(); i++) {
    for (int j = 0; j < divisor.size(); j++) {
      if (check[j] || a[i] % divisor[j] != 0) continue;
      check[j] = 1;
    }
  }
  for (int i = 0; i < divisor.size(); i++) {
    if (!check[i]) {
      cout << "No";
      exit(0);
    }
  }
  cout << "Yes";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> k;
  factorize();
  for (int i = 1; i <= n; i++) {
    int t;
    cin >> t;
    a.push_back(t);
  }
  solve();
}
