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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.List;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author darkhan imangaliyev
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        MyReader in = new MyReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskD solver = new TaskD();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskD {
        final int MAXN = 1000100;
        int[] lp;
        List<Integer> primes;

        public void solve(int testNumber, MyReader in, PrintWriter out) {
            int n = in.nextInt(), k = in.nextInt();
            if (k == 1) {
                out.println("Yes");
                return;
            }
            int[] a = new int[n];
            for (int i = 0; i < n; ++i) {
                a[i] = in.nextInt();
            }
            lp = new int[MAXN];
            primes = new ArrayList<>();
            for (int i = 2; i < MAXN; ++i) {
                if (lp[i] == 0) {
                    lp[i] = i;
                    primes.add(i);
                }
                for (int j = 0; j < primes.size() && primes.get(j) <= lp[i] && (long) i * primes.get(j) < MAXN; ++j) {
                    lp[i * primes.get(j)] = primes.get(j);
                }
            }

            int[] div = new int[MAXN];
            for (int i = 0; i < n; ++i) {
                int cur = a[i], c = 0, prev = -1;
                while (cur > 1) {
                    int divisor = lp[cur];
                    if (divisor != prev) {
                        c = 1;
                        prev = divisor;
                    } else {
                        ++c;
                    }
                    if (div[divisor] < c) div[divisor] = c;
                    cur /= divisor;
                }
            }
            long mod = 1;
            for (int i = 2; i < MAXN; ++i) {
                for (int j = 0; j < div[i]; ++j) {
                    mod *= i;
                    mod %= k;
                }
            }
            if (mod == 0) {
                out.println("Yes");
            } else {
                out.println("No");
            }
        }

    }

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

        public MyReader(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());
        }

    }
}