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

// 最大公約数
ll gcd(ll m, ll n) {
  if (n == 0) return m;
  else return gcd(n, m % n);
}

int main() {
    int N;
    ll H;
    cin >> N >> H;
    ll A[N];
    for (int i = 0; i < N; i++) {
        cin >> A[i];
        if (A[i] < 0) A[i] = -A[i];
    }
    for (int i = 0; i < N; i++) {
        ll g = gcd(H, A[i]);
        H /= g;
    }
    if (H == 1) {
        cout << "YES\n";
    } else {
        cout << "NO\n";
    }
    
    return 0;
}