#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n"); #define all(v) (v).begin(),(v).end() #define all_rev(v) (v).rbegin(),(v).rend() #define debug(x) cout << #x << ": " << x << '\n'; #define degreeToRadian(deg) (((deg)/360)*2*M_PI) #define radianTodegree(rad) (((rad)/2/M_PI)*360) template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } using namespace std; using ll = long long; using P = pair; using PL = pair; const ll INF = 1LL<<60; const int MOD = 1e9 + 7; const int dx[4] = {1, 0, -1, 0}; const int dy[4] = {0, 1, 0, -1}; vector> prime_factorize(ll n) { vector> res; for (ll i = 2; i * i <= n; i++) { if (n % i != 0) continue; ll ex = 0; while (n % i == 0) { ++ex; n /= i; } res.push_back({i, ex}); } if (n != 1) res.push_back({n, 1}); return res; } int main() { //cin.tie(0);ios::sync_with_stdio(false); //cout << fixed << setprecision(15); int n, h; cin >> n >> h; vector> t = prime_factorize(h); for (int i = 0; i < n; i++) { ll a; cin >> a; for (auto &v : t) { if (v.second > 0 && a % v.first == 0) { a /= v.first; v.second--; } } } for (auto v : t) { if (v.second > 0) { cout << "NO" << '\n'; exit(0); } } cout << "YES" << '\n'; return 0; }