Problem: 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 <image>. There are n ancient numbers c1, c2, ..., cn and Pari has to tell Arya <image> 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 <image> for any positive integer x?

Note, that <image> 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 <image> because 5 is one of the ancient numbers.

In the second sample, Arya can't be sure what <image> 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.

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;
import java.math.*;
import java.text.*;
public class Main
{ 


    // recursive implementation
    public static long gcd(long p, long q) {
        if (q == 0L) return p;
        else return gcd(q, p % q);
    }


    public static long lcm(long x, long y) {
        
        return ((x*y)/gcd(x,y));
    }



public static void main(String[] args)throws java.lang.Exception
{
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out=new PrintWriter(System.out);

int n,k,i,gcd1,max;
long rem1,rem2,cur;
boolean found;


StringTokenizer st=new StringTokenizer(in.readLine());

n=Integer.parseInt(st.nextToken());
k=Integer.parseInt(st.nextToken());

long[] c=new long[n];
int[] r=new int[n];

StringTokenizer st1=new StringTokenizer(in.readLine());



for(i=0;i<n;i++)
{
    c[i]=Long.parseLong(st1.nextToken());
}





cur=1L;

for(i=0;i<n;i++)
{
cur=gcd(lcm(cur,c[i]),k);
}




if(cur==k)
    out.println("Yes");
else
    out.println("No");


out.flush();
out.close();

}
}