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 A {

	static int getPower(int x, int p) {
		int lo = 1, hi = (int) (Math.log(x) / Math.log(p));
		int ans = 1;
		while (lo <= hi) {
			int mid = lo + hi >> 1;
			int y = pow(p, mid);
			if (x % y == 0) {
				ans = mid;
				lo = mid + 1;
			} else
				hi = mid - 1;
		}
		return ans;
	}

	static int pow(int b, int e) {
		int ans = 1;
		while (e > 0) {
			if (e % 2 == 1) {
				ans = ans * b;
			}
			e >>= 1;
			b = b * b;
		}
		return ans;
	}

	static ArrayList<Integer> primes;
	static boolean[] isPrime;
	static int[] lcm;
	static int N = (int) 1e6 + 2;
	static boolean[] seen;

	static void sieve() {
		primes = new ArrayList();
		isPrime = new boolean[N];
		Arrays.fill(isPrime, true);
		isPrime[0] = isPrime[1] = false;
		for (int i = 2; i < isPrime.length; i++)
			if (isPrime[i]) {
				primes.add(i);
				if (seen[i])
					lcm[i] = Math.max(lcm[i], 1);
				for (int j = i + i; j < isPrime.length; j += i) {
					isPrime[j] = false;
					if (seen[j])
						lcm[i] = Math.max(lcm[i], getPower(j, i));
				}
			}
	}

	public static void main(String[] args) throws IOException {
		Scanner sc = new Scanner();
		PrintWriter out = new PrintWriter(System.out);
		seen = new boolean[N];
		int n = sc.nextInt(), k = sc.nextInt();

		lcm = new int[N];
		while (n-- > 0) {
			seen[sc.nextInt()] = true;

		}
		sieve();

		boolean ok = true;
		for (int p : primes) {
			if (p * 1L * p > k)
				break;
			int c = 0;
			while (k % p == 0) {
				c++;
				k /= p;
			}
			if (lcm[p] < c)
				ok = false;
		}
		if (k > 1 && lcm[k] < 1)
			ok = false;
		out.println(ok ? "Yes" : "No");
		out.close();

	}

	static class Scanner {
		BufferedReader br;
		StringTokenizer st;

		Scanner() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		Scanner(String fileName) throws FileNotFoundException {
			br = new BufferedReader(new FileReader(fileName));
		}

		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 IOException {
			return Integer.parseInt(next());
		}

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

		double nextDouble() throws NumberFormatException, IOException {
			return Double.parseDouble(next());
		}

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

	}

}