D. Remainders Game(最小公倍数，最大公约数模板)

B. Remainders Game

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Today Pari and Arya are playing a game called Remainders.

Pari chooses two positive integer x and k, and tells Arya k but not x. Arya have to find the value . There are n ancient numbers c1, c2, ..., cn and Pari has to tell Arya  if Arya wants. Given k and the ancient values, tell us if Arya has a winning strategy independent of value of x or not. Formally, is it true that Arya can understand the value  for any positive integer x?

Note, that  means the remainder of x after dividing it by y.

Input

The first line of the input contains two integers n and k (1 ≤ n,  k ≤ 1 000 000) — the number of ancient integers and value k that is chosen by Pari.

The second line contains n integers c1, c2, ..., cn (1 ≤ ci ≤ 1 000 000).

Output

Print "Yes" (without quotes) if Arya has a winning strategy independent of value of x, or "No" (without quotes) otherwise.

Examples

input

4 5
2 3 5 12

output

Yes

input

2 7
2 3

output

No

Note

In the first sample, Arya can understand  because 5 is one of the ancient numbers.

In the second sample, Arya can't be sure what  is. For example 1 and 7 have the same remainders after dividing by 2 and 3, but they differ in remainders after dividing by 7.

大体题意：

告诉你k 但不告诉你x 并且告诉你n个ci来，你也知道x%ci，想让你求出x mod k来！问是否有唯一解！

思路：

反证法，假设解不唯一，有x1，x2，那么x1，x2满足：

x1 % ci == x2 % ci 并且x1 % k != x2 % k,所以 (x1 - x2) % ci == 0 ，(x1-x2) % k != 0

并且lcm(c1,c2,,,,cn) % ci == 0

,所以lcm % （x1-x2） == 0.

且   (x1-x2) % k != 0;

所以lcm % k != 0  

所以命题： 如果解不唯一，那么lcm % k != 0

逆否命题为：  若lcm % k == 0 那么 解唯一！

所以只需要判断lcm是否k 的整数倍，

也就是说这个问题可以转换为：

是否存在x使得  x是c1，c2，c3，，，cn，k的整数倍！

是的话就是yes，否则就是no！

#include<iostream>  
#include<cstdio>
#include<stdio.h>
#include<cstring>  
#include<cstdio>  
#include<climits>  
#include<cmath> 
#include<vector>
#include <bitset>
#include<algorithm>  
#include <queue>
#include<map>
using namespace std;


long long int gcd(long long int x, long long int y)
{
	if (y == 0)
	{
		return x;
	}
	gcd(y, x%y);
}
long long int lcm(long long int x, long long int y)
{
	return x*y / gcd(x, y);
}
long long int n, k, i, ans, a[1000005];
int main()
{
	//cin >> n >> k;
	scanf("%d %d", &n, &k);
	for (i = 1; i <= n; i++)
	{
		//cin >> a[i];
		scanf("%d", &a[i]);
	}
	ans = 0;
	for (i = 1; i <= n; i++)
	{
		if (i == 1)
		{
			ans = a[i];
		}
		else
		{
			ans = lcm(a[i], ans);
		}
		ans %= k;
	}
	
	if (ans== 0)
	{
		//cout << "Yes" << endl;
		printf("Yes\n");
	}
	else
	{
		//cout << "No" << endl;
		printf("No\n");
	}
}