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.*;
/**
 *
 * @author Sourav Kumar Paul
 */
public class SolveD {
    public static void main(String[] args) throws IOException{
        Reader in = new Reader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
       int gpd[] = new int[1000000+5];
       Arrays.fill(gpd,-1);
       for(int i=2; i<=1000000; i++)
       {
           if(gpd[i]==-1)
           {
               for(int j=i; j<=1000000; j+=i)
                   gpd[j] = i;
           }
       }
        int n = in.nextInt();
        int k = in.nextInt();
        int arr[] = new int[1000001];
        for(int i=0; i<n; i++)
        {
            int x= in.nextInt();
           while(x>1)
           {
               int j = gpd[x];
               int cnt = 0;
               while(x%j==0)
               {
                   x/=j;
                   cnt++;
               }
               arr[j] = Math.max(arr[j],cnt);
           }
        }
        int temp[] = new int[1000001];
        
        while(k>1)
        {
            int  j = gpd[k];
            int cnt = 0;
            while(k%j==0)
            {
                k/=j;
                cnt++;
            }
            temp[j] = Math.max(temp[j],cnt);
        }
        boolean flag = true;
        for(int i=0; i<=1000000; i++)
        {
            if(arr[i]< temp[i])
                flag = false;
        }
        if(flag)
            out.println("Yes");
        else
            out.println("No");
        out.flush();
        out.close();
    }
    public static class Reader {
        public BufferedReader reader;
        public StringTokenizer st;

        public Reader(InputStreamReader stream) {
            reader = new BufferedReader(stream);
            st = null;
        }

        public String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
        public String nextLine() throws IOException{
            return reader.readLine();
        }
        public long nextLong(){
            return Long.parseLong(next());
        }
        public double nextDouble(){
            return Double.parseDouble(next());
        }

    }
}