#include <bits/stdc++.h>

#define rep(X, N) for (ll X = 0LL; X < (N); X++)
#define ALL(V) (V).begin(), (V).end()
#define endl "\n"

using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;

const double PI = 3.1415926535897932384626;
const ll MODN = 1000000007;
const ll MODN2 = 998244353;

long long gcd(long long a, long long b){
    if (a < b)
        swap(a, b);
    assert(b != 0);
    if (a % b == 0)
        return b;
    return gcd(b, a % b);
}

int main(){

    int n, h;
    cin >> n >> h;

    vector<int> a(n);

    rep(i, n) cin >> a[i];
    int oldh = h;

    do{
        oldh = h;

        rep(i, n){
            if(a[i] < 0) a[i] = a[i] * -1;
            if(a[i] == 0){
                cout << "YES" << endl;
                return 0;
            }
            int g = gcd(a[i], h);
            a[i] = a[i] / g;
            h = h / g;
        }

    }while(oldh != h);

    cout << (oldh == 1 ? "YES" : "NO") << endl;
    
    return 0;
}