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.util.*;
import java.io.*;
import java.util.HashMap;
import java.util.Map;
public class A
{
      public static void main(String ar[]) throws Exception
      {
            BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
            String s1[]=br.readLine().split(" ");
            String s2[]=br.readLine().split(" ");
            int n=Integer.parseInt(s1[0]);
            int k=Integer.parseInt(s1[1]);
            int a[]=new int[n];
            HashMap<Integer,Integer> hm=new HashMap<Integer,Integer>();
            for(int i=0;i<n;i++)
             a[i]=Integer.parseInt(s2[i]);
            
            int r=k;
            while(k%2==0)
            {
                 if(hm.containsKey(2))
                  hm.put(2,1+hm.get(2));
                 else
                  hm.put(2,1);
                 k=k/2;
            }
            
            for(int i=3;i<=Math.sqrt(r);i+=2)
            {
                  while(k%i==0)
            {
                 if(hm.containsKey(i))
                  hm.put(i,1+hm.get(i));
                 else
                  hm.put(i,1);
                 k=k/i;
            }
            }
            
            if(k>2)
            {
                 if(hm.containsKey(k))
                  hm.put(k,1+hm.get(k));
                 else
                  hm.put(k,1);
            }
            
            boolean bb1=true;
            for(int u:hm.keySet())
            {
                  int v=hm.get(u);
                  boolean bb=false;
                  for(int i=0;i<n;i++)
                  {
                        int p=a[i];
                        int x=0;
                        while(p%u==0)
                        { p=p/u; x++; }
                        if(x>=v)
                         bb=true;
                  }
                  if(!bb)
                   bb1=false;
            }
            
            if(bb1)
             System.out.println("Yes");
            else
             System.out.println("No");
      }
}