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

import static java.lang.Integer.parseInt;
import static java.nio.charset.StandardCharsets.UTF_8;

public class Main {

    public static void main(String[] args) throws IOException {
        try (BufferedReader in = new BufferedReader(new InputStreamReader(System.in, UTF_8));
             BufferedWriter out = new BufferedWriter(new OutputStreamWriter(System.out, UTF_8))) {
            StringTokenizer tokens = new StringTokenizer(in.readLine());
            int n = parseInt(tokens.nextToken());
            int k = parseInt(tokens.nextToken());
            tokens = new StringTokenizer(in.readLine());
            List<Pair> pairs = factorize(k);
            boolean ok = false;
            for (int i = 0; i < n; i++) {
                int value = Integer.parseInt(tokens.nextToken());
                for (int j = pairs.size() - 1; j >= 0; j--) {
                    int p = pairs.get(j).p;
                    int deg = pairs.get(j).deg;
                    if (value % p == 0) {
                        int cnt = 0;
                        while (value % p == 0) {
                            cnt++;
                            value /= p;
                        }
                        if (cnt >= deg) {
                            pairs.remove(j);
                        }
                    }
                }
                if (pairs.isEmpty()) {
                    ok = true;
                    break;
                }
            }
            out.write(ok ? "Yes" : "No");
            out.newLine();
        }
    }

    private static List<Pair> factorize(int k) {
        List<Pair> pairs = new ArrayList<>();
        for (int i = 2; i <= k; i++) {
            if (k % i == 0) {
                int cnt = 0;
                while (k % i == 0) {
                    cnt++;
                    k /= i;
                }
                pairs.add(new Pair(i, cnt));
            }
        }
        return pairs;
    }

    private static class Pair {

        final int p;
        final int deg;

        public Pair(int p, int deg) {
            this.p = p;
            this.deg = deg;
        }
    }
}