#include <bits/stdc++.h>
using namespace std;
const long long N = 1000010;
long long n, m, c[N];
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
void read() {
  scanf("%I64d%I64d", &n, &m);
  for (long long i = 1; i <= n; i++) scanf("%I64d", &c[i]);
}
void solve() {
  long long g, t;
  g = 1;
  for (long long i = 1; i <= n; i++) {
    t = gcd(c[i], m);
    g = g * t / gcd(g, t);
  }
  if (g == m)
    printf("Yes\n");
  else
    printf("No\n");
}
int main() {
  read();
  solve();
  return 0;
}
