#include <bits/stdc++.h>
using namespace std;
const int maxn = 10005;
int i, j, t, n, m, l, r, k, z, y, x;
long long c;
int gcd(int a, int b) { return (b == 0) ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
int main() {
  scanf("%d%d", &n, &k);
  c = 1;
  for (i = 1; i <= n; i++) {
    scanf("%d", &x);
    c = lcm(c, x) % k;
  }
  if (c == 0)
    printf("Yes\n");
  else
    printf("No\n");
  return 0;
}
