#include <iostream>
#include <string>
#include <cmath>
#include <vector>

using namespace std;

int mass[10000000]={0};

int maxDivs[10000000]={0};

const int N = 10000000;
int lp[N+1];
vector<int> pr;



int main()
{


    for (int i=2; i<=N; ++i) {
        if (lp[i] == 0) {
            lp[i] = i;
            pr.push_back (i);
        }
        for (int j=0; j<(int)pr.size() && pr[j]<=lp[i] && i*pr[j]<=N; ++j)
            lp[i * pr[j]] = pr[j];
    }



    int n,k;

    scanf("%d %d",&n,&k);

    for(int i=0;i<n;i++)
        scanf("%d",mass+i);

    lp[1]=1;

    for(int i=0;i<n;i++)
    {
        if(mass[i]==1)
            continue;

        for(int u=lp[mass[i]];u>1;u=lp[mass[i]])
        {
            int howMuch=0;
            while((mass[i]%u)==0)
            {
                mass[i]/=u;
                howMuch++;
            }

            maxDivs[u]=max(maxDivs[u],howMuch);
        }
    }

if(k==1)
{
    cout<<"Yes";
    return 0;

}

    for(int i=2;i<10000000;i++)
        for(int u=0;u<maxDivs[i];u++)
        {
            if(k%i==0)
                k/=i;
        }

    if(k<2)
        cout<<"Yes";
    else
    cout<<"No";
}