#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
using ll = long long int;
using P = pair<int, int>;
int main(){
    ll n, h;
    cin >> n >> h;
    vector<ll> a(n);
    for(auto &p: a) cin >> p;
    
    vector<P> hfactor;
    for(int i = 2; h > 1; i++){
        if(h % i == 0){
            int cnt = 0;
            while(h > 1 && h % i == 0){
                cnt++;
                h /= i;
            }
            hfactor.push_back(make_pair(i, cnt));
        }
    }
    vector<int> countfac(hfactor.size(), 0);
    for(auto p: a){
        p = abs(p);
        for(int i = 0; i < hfactor.size(); i++){
            if(hfactor[i].second <= countfac[i]) continue;
            while(p > 1 && p % hfactor[i].first == 0){
                countfac[i]++;
                p /= hfactor[i].first;
            }
        }
    }

    string ans = "YES";
    for(int i = 0; i < hfactor.size(); i++){
        if(hfactor[i].second > countfac[i]) ans = "NO";
    }
    cout << ans << endl;
    return 0;
}