#include <bits/stdc++.h>
using namespace std;
int n, k, c;
long long C;
int gcd(int a, int b) { return !b ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return (long long)a * b / gcd(a, b); }
int main() {
  scanf("%d%d", &n, &k);
  C = 1;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &c);
    int g = gcd(c, k);
    c = g;
    C = lcm(c, C);
  }
  if (C % k == 0)
    puts("Yes");
  else
    puts("No");
  return 0;
}
