#include <bits/stdc++.h>
using namespace std;
int n, k, m = 1000010, p[1010000], a[1010000], c[1000000];
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; i++) scanf("%d", &c[i]);
  if (k == 1) {
    printf("Yes");
    return 0;
  }
  for (int i = 2; i < m; i++) {
    if (p[i] == 0) {
      for (int j = i; j < m; j += i) p[j] = i;
    }
  }
  fill(a, a + m, 0);
  vector<pair<int, int> > t, tk;
  for (int i = 0; i < n; i++) {
    if (c[i] == 1) continue;
    int s = c[i];
    t.clear();
    t.push_back(make_pair(p[s], 1));
    s /= p[s];
    while (s > 1) {
      bool nn = 0;
      for (int j = 0; j < t.size(); j++) {
        if (p[s] == t[j].first) {
          t[j].second++;
          nn = 1;
        }
      }
      if (nn == 0) t.push_back(make_pair(p[s], 1));
      s /= p[s];
    }
    for (int j = 0; j < t.size(); j++) {
      int f = t[j].first;
      a[f] = max(a[f], t[j].second);
    }
  }
  tk.push_back(make_pair(p[k], 1));
  k /= p[k];
  while (k > 1) {
    bool nn = 0;
    for (int j = 0; j < tk.size(); j++) {
      if (p[k] == tk[j].first) {
        tk[j].second++;
        nn = 1;
      }
    }
    if (nn == 0) tk.push_back(make_pair(p[k], 1));
    k /= p[k];
  }
  for (int i = 0; i < tk.size(); i++) {
    int r = tk[i].first;
    if (tk[i].second > a[r]) {
      cout << "No" << endl;
      return 0;
    }
  }
  cout << "Yes" << endl;
  return 0;
}
