#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>

using namespace std;
using ll = long long;
using ull = unsigned long long;

ll mod = 1e9 + 7;

long long gcd(long long a,long long b){
	long long x=max(a,b),y=min(a,b);
	if(x%y==0)return y;
	else return gcd(y,x%y);
}

long long lcm(long long a,long long b){
	return (a/gcd(a,b))*b;
}

int main(){	
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n , h;
	cin >> n >> h;
	vector<int> a(n);
	for(int i = 0; i < n; i++){
		cin >> a[i];
	}
	int g = a[0];
	for(int i = 1; i < n; i++){
		g = gcd(g , a[i]);
	}
	if(g % h == 0 || h % g == 0){
		cout << "YES" << endl;
	}else{
		cout << "NO" << endl;
	}
	return 0;
}