#include <bits/stdc++.h>
using namespace std;
const long long lINF = 1000000000000000000;
const int INF = 1000000000;
long long gcd(long long x, long long y) { return y ? gcd(y, x % y) : x; }
long long lcm(long long x, long long y) { return x * 1ll * y / gcd(x, y); }
int main() {
  iostream::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, k;
  cin >> n >> k;
  long long cur = 1;
  for (long long i = 0; i < n; ++i) {
    long long x;
    cin >> x;
    cur = gcd(k, lcm(cur, x));
  }
  if (cur == k)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
  return 0;
}
