// Template #include "bits/stdc++.h" #define rep_override(x, y, z, name, ...) name #define rep2(i, n) for (int i = 0; i < (int)(n); ++i) #define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i) #define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__) #define per(i, n) for (ll i = (ll)(n) - 1; i >= 0; --i) #define all(x) (x).begin(), (x).end() using namespace std; using ll = long long; constexpr int inf = 1001001001; constexpr ll INF = 3003003003003003003LL; template inline bool chmin(T &x, const T &y) { if (x > y) { x = y; return true; } return false; } template inline bool chmax(T &x, const T &y) { if (x < y) { x = y; return true; } return false; } struct IOSET { IOSET() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); } } ioset; template istream &operator>>(istream &is, vector &vec) { for (T &element : vec) is >> element; return is; } template vector operator--(vector &vec) { for (T &element : vec) --element; return vec; } // Main int main() { int n, h; cin >> n >> h; vector a(n); rep(i, n) { cin >> a[i]; if (a[i] < 0) a[i] *= -1; } bool zero = false; rep(i, n) if (!a[i]) zero = true; if (zero) { cout << "YES\n"; return 0; } map mp; for (int i = 2; i * i <= h; ++i) { while (h % i == 0) { ++mp[i]; h /= i; } } if (h != 1) ++mp[h]; for (auto [p, cnt] : mp) { int c = 0; rep(i, n) { int a_ = a[i]; while (a_ % p == 0 && a_ != 0) { ++c; a_ /= p; } } if (c < cnt) { cout << "NO\n"; return 0; } } cout << "YES\n"; }