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

int main() {
    int N;
    int H;
    cin >> N >> H;
    int A[N];
    for (int i = 0; i < N; i++) {
        cin >> A[i];
        if (A[i] < 0) A[i] = -A[i];
    }
    map<int, int> m;
    for (int i = 2; i * i <= H; i++) {
        while (H % i == 0) {
            m[i]++;
            H /= i;
        }
    }
    m[H]++;
    for (auto it = m.begin(); it != m.end(); it++) {
        int cnt = 0;
        for (int i = 0; i < N; i++) {
            while (A[i] % it->first == 0) {
                cnt++;
                A[i] /= it->first;
            }
            if (cnt >= it->second) break;
        }
        //cout << cnt << "\n";
        if (cnt < it->second) {
            cout << "NO\n";
            return 0;
        }
    }
    cout << "YES\n";
    return 0;
}