/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.10.09 21:24:53
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;



template<typename T>
vector<pair<T,int>> prime_factorization(T n) {
    vector<pair<T, int>> res;
    for (T i = 2; i*i <= n; i++) {
        int cnt = 0;
        while (n % i == 0) {
            n /= i;
            cnt++;
        }
        if (cnt > 0) res.push_back({i,cnt});
    }
    if (n > 1) res.push_back({n,1});
    return res;
}
int main() {
    int n,h;cin >> n >> h;
    vector<int> a(n);
    auto v = prime_factorization(h);
    for (int i = 0; i < n; i++) {
        int a;cin >> a;
        for (int j = 0; j < v.size(); j++) {
            if (a == 1) break;
            if (v[j].second == 0) continue;
            while(v[j].second >= 1 && a % v[j].first == 0) {
                a /= v[j].first;
                v[j].second--;
            }
        }
    }
    for (int i = 0; i < v.size(); i++) {
        if (v[i].second != 0) {
            puts("NO");
            return 0;
        }
    }
    puts("YES");
    return 0;
}