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.StringTokenizer;

public class Main {
    public static void main(String args[]) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Solver object = new Solver();
        object.solve(in, out);
        out.close();
    }

    static class Solver {
        static final int SIZE = 1_000_001;
        int[] p;
        int[] temp;

        public void solve(InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int k = in.nextInt();

            prepareSieve();
            int[] fk = new int[SIZE];
            int[] fc = new int[SIZE];
            temp = new int[SIZE];
            factorize(k, fk);

            for (int i = 1; i <= n; ++i) {
                int c = in.nextInt();
                factorize(c, fc);
            }

            boolean yes = true;
            for (int i = 2; i < SIZE; ++i) {
                yes &= fc[i] >= fk[i];
            }

            if (yes) {
                out.println("Yes");
            } else {
                out.println("No");
            }
        }

        void factorize(int value, int[] f) {
            ArrayList<Integer> a = new ArrayList<>();
            while (value > 1) {
                ++temp[p[value]];
                a.add(p[value]);
                value /= p[value];
            }
            for (int x : a) {
                f[x] = Math.max(f[x], temp[x]);
                temp[x] = 0;
            }
        }

        void prepareSieve() {
            p = new int[SIZE];
            for (int i = 2; i * i < SIZE; ++i) {
                if (p[i] == 0) {
                    for (int j = i * i; j < SIZE; j += i) {
                        p[j] = i;
                    }
                }
            }
            for (int i = 2; i < SIZE; ++i) {
                if (p[i] == 0) {
                    p[i] = i;
                }
            }
        }
    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

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

    }
}