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.*;

public class Codeforces687B {
	public static int gcd(int a, int b) {
		if(b == 0)
			return a;
		return gcd(b, a%b);
	}
	public static ArrayList<Integer> sieve(int limit) {
		boolean[] good = new boolean[limit + 1];
		for(int i = 2; i <= limit; i++)
			good[i] = true;
		for(int i = 2; i <= Math.sqrt(limit); i++) {
			for(int j = i; i*j <= limit; j++) {
				good[i*j] = false;
			}
		}
		ArrayList<Integer> primes = new ArrayList<Integer>();
		for(int i = 2; i <= limit; i++) {
			if(good[i])
				primes.add(i);
		}
		return primes;
	}
	public static int[] primeFactorize(ArrayList<Integer> primes, int k) {
		int[] powers = new int[primes.size()];
		for(int i = 0; i < primes.size(); i++)
			powers[i] = 1;
		for(int i = 0; i < primes.size(); i++) {
			if(k == 1)
				break;
			int p = primes.get(i);
			while(k%p == 0) {
				powers[i] *= p;
				k /= p;
			}
		}
		return powers;
	}
	public static void main(String[] args) {
		try {
			BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int k = Integer.parseInt(st.nextToken());
			int[] a = new int[n];
			st = new StringTokenizer(f.readLine());
			for(int i = 0; i < n; i++) {
				a[i] = Integer.parseInt(st.nextToken());
			}
			boolean good = true;
			int[] primeF = primeFactorize(sieve(k), k);
			for(int i = 0; i < primeF.length; i++) {
				boolean good1 = false;
				for(int j = 0; j < n; j++) {
					if(a[j]%primeF[i] == 0) {
						good1 = true;
						break;
					}
				}
				good = good1;
				if(!good)
					break;
			}
			if(good)
				System.out.println("Yes");
			else
				System.out.println("No");
		}
		catch(IOException e) {
			e.printStackTrace();
		}
	}
}