#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const int maxn = 1e6 + 5;
long long gcd(long long a, long long b) {
  if (!b) return a;
  return gcd(b, a % b);
}
long long c, k;
int n;
int main() {
  cin >> n >> k;
  long long lcm = 1, x;
  for (int i = 0; i < n; ++i) {
    scanf("%I64d", &c);
    x = gcd(c, k);
    lcm *= x / gcd(lcm, x);
  }
  if (lcm == k)
    puts("Yes");
  else
    puts("No");
  return 0;
}
