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.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class RemainderGame {
	
	static int largestPrime[];
	static int end = 1000001;
	
	static void sieve()
	{
		largestPrime = new int[end];
		
		for(int i=2; i<largestPrime.length; i++)
			if(largestPrime[i] == 0){
				for(int j=i; j < largestPrime.length; j+=i)
					largestPrime[j] = i;
			}
	}
	
	
	static int lcmPrimes[];
	static int kPrimes[];
	
	static void augmentLCM(int c)
	{
		
		while(c > 1)
		{
			int prime = largestPrime[c];
			int countP = 0;
			while(c % prime == 0)
			{
				c /= prime;
				countP++;
			}
			lcmPrimes[prime] = Math.max(lcmPrimes[prime], countP);
		}
	}
	
	static void decomposeK(int k)
	{
		while(k > 1)
		{
			int prime = largestPrime[k];
			int countP = 0;
			while(k % prime == 0)
			{
				k /= prime;
				countP++;
			}
			kPrimes[prime] = countP;
		}
	}
	
	static boolean isDivisble()
	{
		for(int i=0; i<end; i++)
			if(kPrimes[i] > lcmPrimes[i]){
				return false;
			}
		return true;
	}
	
	public static void main(String[] args) throws NumberFormatException, IOException {
		Scanner sc = new Scanner(System.in);
		sieve();
		int n = sc.nextInt();
		int k = sc.nextInt();

		lcmPrimes = new int[end];
		kPrimes = new int[end];
		
		for(int i=0; i<n; i++)
			augmentLCM(sc.nextInt());
		
		decomposeK(k);
		
		System.out.println(isDivisble()? "Yes" : "No");
		
		
		
		
	}
	static class Scanner {
		BufferedReader br;
		StringTokenizer st;

		Scanner(FileReader f) {
			br = new BufferedReader(f);
		}

		public boolean ready() throws IOException {
			return br.ready();
		}

		Scanner(InputStream s) {
			br = new BufferedReader(new InputStreamReader(s));
		}

		String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

		String nextLine() throws IOException {
			return br.readLine();
		}

		int nextInt() throws NumberFormatException, IOException {
			return Integer.parseInt(next());
		}

		long nextLong() throws NumberFormatException, IOException {
			return Long.parseLong(next());
		}
	}
	
}