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.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Map.Entry;
import java.util.Scanner;
import java.util.TreeMap;

public class R1 {

	public static void main(String args[]) throws IOException {

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));

		// Scanner sc = new Scanner(System.in);

		String s[] = br.readLine().split(" ");

		int n = Integer.parseInt(s[0]);
		int k = Integer.parseInt(s[1]);

		int c[] = new int[n];
		s = br.readLine().split(" ");

		c[0] = Integer.parseInt(s[0]);

		if (n == 1) {
			if (c[0] % k == 0)
				System.out.println("Yes");
			else
				System.out.println("No");
			return;
		}

		c[1] = Integer.parseInt(s[1]);

		if (k == 1 || k == c[0] || k == c[1]) {
			System.out.println("Yes");
			return;
		}

		long gtemp = gcd(Math.max(c[0], c[1]), Math.min(c[0], c[1]));
		long val = ((1l * c[0] * c[1]) / gtemp);
		// System.out.println(val + " val ");
		val %= k;

		for (int i = 2; i < n; i++) {

			c[i] = Integer.parseInt(s[i]);
			if (k == c[i]) {
				System.out.println("Yes");
				return;
			}

			if (c[i] == 1)
				continue;

			long gc = gcd(Math.max(val, c[i]), Math.min(val, c[i]));

			val = ((val * c[i] * 1l) / gc);
			// System.out.println(val + " val ");
			val %= k;

			if (val == 0) {
				System.out.println("Yes");
				return;
			}
		}

		if (val % k == 0)
			System.out.println("Yes");
		else
			System.out.println("No");

	}

	public static long gcd(long a, long b) {

		if (b == 0)
			return a;

		return gcd(b, a % b);
	}
}