Jumps（裴蜀定理）

http://codeforces.com/gym/101341/problem/D

　A frog lives in a one-dimensional world in the point with the coordinate 0. He needs to get to the point with the coordinate x. For some reason he cannot make jumps of arbitrary length, and can jump only by a₁, ..., a_n in any direction. Is he able to reach x?

Input

　The first line contains two integers n and x separated by a space (1 ≤ n ≤ 200000,  - 10⁹ ≤ x ≤ 10⁹) — the number of variants of jump length and the coordinate of the point to reach.

　The second line contains n integers a_i separated by spaces (1 ≤ a_i ≤ 10⁹) — the lengths of jumps the frog can make.

 

Output

　Output «YES» (without quotes), if the frog can reach the point x, otherwise output «NO» (without quotes).

 

Examples

Input

3 17
3 5 4

Output

YES

Input

4 5
10 20 30 40

Output

NO

裴蜀定理

　具体步骤就是求gcd，看要组成的数是不是这个gcd的倍数

 

 

#include <bits/stdc++.h>

using namespace std;

int main()
{
    long long n, x, xx, data, i;
    scanf("%lld %lld", &n, &x);
    for(i=0;i<n;i++)
    {
        scanf("%lld", &data);
        if(i==0) xx = data;
        else xx = __gcd(xx, data);
    }
    if(x%xx==0) printf("YES\n");
    else printf("NO\n");
    return 0;
}