关于在求最小公倍数的过程中取模

typedef long long ll;
ll gcd(ll a, ll b){
	if(b==0)return a;
	return gcd(b, a%b);
}
int main(){
	int n, k;
	ll ans = 1, c;
	scanf("%d%d", &n, &k);
	for(int i = 1; i<=n; i++){
		scanf("%lld", &c);
		ans = ans/gcd(c, ans)*c%k;  // ???
		if(!ans){
			cout << "Yes";
			return 0;
		}
	}
	cout << "No";
	return 0;
}