#include <bits/stdc++.h>
using namespace std;
int n, k;
int c[1000001];
int gcd(int u, int v) {
  if (!u) return v;
  return gcd(v % u, u);
}
int main() {
  scanf("%d%d", &n, &k);
  long long m = 1;
  for (int i = 1; i <= n; i++) scanf("%d", &c[i]);
  for (int i = 1; i <= n; i++) {
    int u = gcd(k, c[i]);
    long long t = (long long)m * u / (gcd(m, u));
    if (t > k) {
      cout << "No";
      return 0;
    }
    m = t;
  }
  if (m == k)
    cout << "Yes";
  else
    cout << "No";
}
