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.util.*;
import java.io.*;


public class hello {
	public static class FastReader {
		BufferedReader br;
		StringTokenizer st;

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

		String next() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException  e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}
	}
	public static FastReader sc = new FastReader();
	public static void take_array(long arr[], int size) {
		for (int i = 0; i < size; i++) {
			arr[i] = sc.nextLong();
		}
	}
	public static void print_arr(long arr[]) {
		for (long x : arr)
			System.out.print(x + " ");
	}
	public static String[] convert_String_to_arr(String s) {
		String arr[] = new String[s.length()];
		for (int i = 0; i < s.length(); i++) {
			arr[i] = String.valueOf(s.charAt(i));
		}
		return arr;
	}
	public static void take_prefix_array(long arr[], int size, long []prefix) {
		long temp = 0;
		for (int i = 0; i < size; i++) {
			temp += arr[i];
			prefix[i] = temp;
		}
	}
	public static void print(Object c, int a) {
		if (a == -1)
			System.out.print(c + " ");
		else
			System.out.println(c);
	}
	public static void space() {
		System.out.println();
	}
	public static long sum_array(long arr[]) {
		long sum = 0;
		for (long x : arr)
			sum += x;
		return sum;
	}
	public static void swap(long a, long b) {
		long temp = a;
		a = b;
		b = temp;
	}
	public static long min(long a, long b, long c) {
		return Math.min(a, Math.min(b, c));
	}
	public static long max(long a, long b, long c) {
		return Math.max(a, Math.max(b, c));
	}
	public static long gcd(long a, long b) {
		if (a < b)swap(a, b);
		if (b == 0)return a;
		return gcd(b, a % b);
	}
	public static long lcm(long a, long b) {
		return (a * b) / gcd(a, b);
	}
	public static void main(String []args) {
		int n = sc.nextInt();
		long k = sc.nextLong();
		long res = 1;
		for (int i = 0; i < n; i++) {
			res = gcd(lcm(sc.nextLong(), res), k);
		}
		if (res == k)
			print("Yes", 0);
		else
			print("No", 0);
	}
}