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:
//  /package Mathema/tic/al;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashMap;

public class ChineseRemainder {
    public static HashMap<Integer,Integer> getPower(int n,int sieve[]){
        int copy=n;
        HashMap<Integer,Integer> map=new HashMap<>();
        while(n!=1){
            if(!map.containsKey(sieve[n]))
            map.put(sieve[n],1);
            else{
                map.put(sieve[n],map.get(sieve[n])+1);
            }
            n/=sieve[n];
        }
        return map;
    }
    public static void main(String[] args)throws IOException {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        int seive[]=new int[1000001];
        ArrayList<Integer> primes=new ArrayList<>();
        for(int i=2;i<=1000000;i++){
            if(seive[i]==0){
                seive[i]=i;
                for(int j=2*i;j<=1000000;j+=i){
                    seive[j]=i;
                }
            }
        }
        String line[]=br.readLine().split(" ");
        int n=Integer.parseInt(line[0]);
        int k=Integer.parseInt(line[1]);
        line=br.readLine().split(" ");
        int a[]=new int[n];
        for(int i=0;i<n;i++){
            a[i]=Integer.parseInt(line[i]);
        }
        HashMap<Integer,Integer> reqd=getPower(k,seive);
//        System.out.println(reqd.toString());
        boolean flag=true;
        for(int key:reqd.keySet()){
            flag=false;
            int temp=reqd.get(key);
            for(int i=0;i<n;i++){
                int count=0;
                int u=a[i];
                while(u%key==0&&u!=1){
                    u/=key;
                    count++;
                }
                if(count>=temp){
                    flag=true;
                    break;
                }
            }
            if(!flag){
                break;
            }
        }
        if(flag){
            System.out.println("Yes");
        }
        else{
            System.out.println("No");
        }
    }
}