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.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class B {

	static StringTokenizer st;
	static BufferedReader br;
	static PrintWriter pw;
	public static void main(String[] args) throws IOException {
		br = new BufferedReader(new InputStreamReader(System.in));
		pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
		int n = nextInt();
		int k = nextInt();
		int max = (int) 1e6;
		int[]lp = new int[max+1];
		for (int i = 2; i <= max; i++) {
			for (int j = i; j <= max; j += i) {
				if (lp[j]==0)
					lp[j] = i;
			}
		}
		int[]pows = new int[max+1];
		for (int i = 1; i <= n; i++) {
			int c = nextInt();
			int last = 0, cnt = 0;
			while (c > 1) {
				if (lp[c]==last)
					cnt++;
				else {
					if (last > 0)
						pows[last] = Math.max(pows[last], cnt);
					last = lp[c];
					cnt = 1;
				}
				c /= lp[c];
			}
			if (last > 0) {
				pows[last] = Math.max(pows[last], cnt);
			}
		}
		while (k > 1) {
			pows[lp[k]]--;
			k /= lp[k];
		}
		for (int i = 1; i <= max; i++) {
			if (pows[i] < 0) {
				System.out.println("No");
				return;
			}
		}
		System.out.println("Yes");
		pw.close();
	}
	
	private static int nextInt() throws IOException {
		return Integer.parseInt(next());
	}
	private static long nextLong() throws IOException {
		return Long.parseLong(next());
	}
	private static double nextDouble() throws IOException {
		return Double.parseDouble(next());
	}
	private static String next() throws IOException {
		while (st==null || !st.hasMoreTokens())
			st = new StringTokenizer(br.readLine());
		return st.nextToken();
	}
}