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

// ユークリッドの互除法
long long gcd(long long a, long long b)
{
    if (a % b == 0)
    {
        return b;
    }
    else
    {
        return gcd(b, a % b);
    }
}

int main()
{
    long long n, k;
    cin >> n >> k;

    vector<long long> a(n);
    for (auto &in : a)
    {
        cin >> in;
    }
    long long aGcd = a[0];
    for (int i = 1; i < n; i++)
    {
        aGcd = gcd(aGcd, a[i]);
    }

    for (auto &elem : a)
    {
        elem /= aGcd;
    }

    bool ans = true;
    for (auto elem : a)
    {
        if(k % elem == 0)
        {
            k /= elem;
        }
    }
    

    if (k == 1)
    {
        cout << "Yes" << endl;
    }
    else
    {
        cout << "No" << endl;
    }
}