#include <bits/stdc++.h>
using namespace std;
int n, k, total;
int prime[105], p = 0, cnt[105], flag[105];
void findfactor() {
  int temp = k;
  for (int i = 2, t = int(sqrt(k)); i <= t; i++) {
    if (temp % i == 0) {
      prime[++p] = i;
      cnt[p] = 0;
      flag[p] = 0;
      while (temp % i == 0) {
        temp /= i;
        cnt[p]++;
      }
      t = int(sqrt(temp));
    }
  }
  if (temp != 0) {
    prime[++p] = temp;
    cnt[p] = 1;
    flag[p] = 0;
  }
  return;
}
void solve(int x) {
  for (int i = 1; i <= p; i++) {
    if (flag[i]) continue;
    bool can = 1;
    for (int j = 1; j <= cnt[i]; j++) {
      if (x % prime[i] == 0) {
        x /= prime[i];
      } else {
        can = 0;
        break;
      }
    }
    if (can) {
      flag[i] = 1;
      total--;
    }
  }
  return;
}
int main() {
  scanf("%d%d", &n, &k);
  findfactor();
  total = p;
  for (int i = 1, now; i <= n; i++) {
    scanf("%d", &now);
    solve(now);
    if (total == 0) {
      puts("Yes");
      return 0;
    }
  }
  puts("No");
  return 0;
}
