codeforces 687B 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.

题目大意：

给出n个数，和一个数k。已知未知数X对这n个数的mod值，问是否能够求得X对k的mod值。

思路：

如果给出的n个数的最小公倍数是k的倍数，那么就输出Yes、

一秒变傻逼系列...........

Ac代码：

#include<stdio.h>
#include<string.h>
using namespace std;
#define ll long long int
ll gcd(ll x,ll y)
{
    if(x%y==0)return y;
    else return gcd(y,x%y);
}
ll lcm(ll x,ll y)
{
    return x/gcd(x,y)*y;
}
int main()
{
    ll n,k;
    while(~scanf("%I64d%I64d",&n,&k))
    {
        ll tmp;
        ll ans;
        for(int i=0;i<n;i++)
        {
            scanf("%I64d",&tmp);
            if(i==0)
            {
                ans=tmp;
            }
            else ans=lcm(ans,tmp);
            ans%=k;
        }
        if(ans==0)
        {
            printf("Yes\n");
        }
        else printf("No\n");
    }
}