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.ArrayList;
import java.util.List;

/**
 * Created by chao on 16/12/14.
 */
public class A {

    static List<Integer>[] list;
    static int[] color;

    public static void main(String[] args) throws IOException {
        PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));


        String[] nums = br.readLine().split(" ");
        int n = Integer.parseInt(nums[0]);
        int k = Integer.parseInt(nums[1]);
        if (k == 1) pw.println("Yes");
        else {
            nums = br.readLine().split(" ");
            int[] a = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = Integer.parseInt(nums[i]);
            }

            boolean isOK = false;
            for (int i = 2; i <= k; i++) {
                if (k % i == 0) {
                    int val = 1;
                    while (k % i == 0) {
                        val *= i;
                        k /= i;
                    }

                    isOK = false;
                    for (int j = 0; j < n; j++) {
                        if (a[j] % val == 0) {
                            isOK = true;
                            break;
                        }
                    }
                    if (!isOK) break;
                }
            }
            if (isOK) pw.println("Yes");
            else pw.println("No");
        }

        pw.flush();
        pw.close();
        br.close();

    }


}