#include <bits/stdc++.h>
using namespace std;
class Point {
 public:
  double x, y;
  Point(double x = 0, double y = 0) : x(x), y(y) {}
  Point operator+(Point p) { return Point(x + p.x, y + p.y); }
  Point operator-(Point p) { return Point(x - p.x, y - p.y); }
  Point operator*(double a) { return Point(x * a, y * a); }
  Point operator/(double a) { return Point(x / a, y / a); }
  double absv() { return sqrt(norm()); }
  double norm() { return x * x + y * y; }
  bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const Point &p) const {
    return fabs(x - p.x) < (1e-10) && fabs(y - p.y) < (1e-10);
  }
};
struct Segment {
  Point p1, p2;
};
double hen(Point a) {
  if (fabs(a.x) < (1e-10) && a.y > 0)
    return acos(0);
  else if (fabs(a.x) < (1e-10) && a.y < 0)
    return 3 * acos(0);
  else if (fabs(a.y) < (1e-10) && a.x < 0)
    return 2 * acos(0);
  else if (fabs(a.y) < (1e-10) && a.x > 0)
    return 0.0;
  else if (a.y > 0)
    return acos(a.x / a.absv());
  else
    return 2 * acos(0) + acos(-a.x / a.absv());
}
double dot(Point a, Point b) { return a.x * b.x + a.y * b.y; }
double cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int n, k;
int e[200] = {0};
vector<int> ve, ve2;
vector<int> insuu;
vector<string> st, st2;
string wa(string s, string t) {
  int u = s.length();
  string q;
  for (int i = 0; i < u; i++) {
    q += "w";
    q[i] = '0' + ((s[i] - '0') | (t[i] - '0'));
  }
  return q;
}
int main() {
  cin >> n >> k;
  if (k == 1) {
    cout << "Yes" << endl;
    return 0;
  }
  for (int i = 2; i < 1000005; i++) {
    if (k == 1) break;
    if (k % i != 0) continue;
    int u = 1;
    while (k % i == 0) {
      k = k / i;
      u *= i;
    }
    ve.push_back(u);
    ve2.push_back(i);
  }
  int q = ve.size();
  string ze = "", ic = "";
  for (int i = 0; i < q; i++) ze += "0";
  for (int i = 0; i < q; i++) ic += "1";
  for (int i = 0; i < n; i++) {
    int u, u2;
    scanf("%d", &u);
    for (int j = 0; j < q; j++) {
      if (u % ve[j] == 0) e[j] = 1;
    }
  }
  int tt = 0;
  int ans = 0;
  for (int i = 0; i < q; i++) {
    tt += e[i];
  }
  if (tt == q) ans = 1;
  if (ans == 1)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
  return 0;
}
