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.InputMismatchException;
import java.io.IOException;
import java.util.ArrayList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in Actual solution is at the top
 *
 * @author Alex
 */
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);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskB {
        static final int NMAX = (int) 1e6 + 1;
        ArrayList<Integer> primes;
        boolean[] vis;

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

            // we need to check if lcm (a1, a2, ..., an) % k == 0

            findPrimes();

            ArrayList<Pair<Integer, Integer>> kFactorization = factorize(k);
            boolean[] good = new boolean[kFactorization.size()];

            for (int i = 0; i < n; i++) {
                int currValue = in.readInt();

                for (int j = 0; j < kFactorization.size(); j++) {
                    if (!good[j]) {
                        int factor = kFactorization.get(j).first;
                        int exponent = kFactorization.get(j).second;

                        int cnt = 0;
                        while (currValue % factor == 0) {
                            currValue /= factor;
                            cnt++;
                        }

                        if (cnt >= exponent) {
                            good[j] = true;
                        }
                    }
                }
            }

            boolean bad = false;
            for (int i = 0; i < kFactorization.size(); i++) {
                if (!good[i]) {
                    bad = true;
                    break;
                }
            }

            out.println(bad ? "No" : "Yes");
        }

        void findPrimes() {
            vis = new boolean[NMAX];
            primes = new ArrayList<>();
            primes.add(2);

            int last = 3;
            for (int i = 3; i * i < NMAX; i += 2) {
                if (!vis[i]) {
                    primes.add(i);
                    for (int j = i * i; j < NMAX; j += 2 * i) {
                        vis[i] = true;
                    }
                }

                last = i;
            }

            for (int i = last + 2; i < NMAX; i++) {
                if (!vis[i]) {
                    primes.add(i);
                }
            }
        }

        ArrayList<Pair<Integer, Integer>> factorize(int x) { // (factor, exponent)
            ArrayList<Pair<Integer, Integer>> factorization = new ArrayList<>();

            for (Integer prime : primes) {
                if (prime * prime > x) {
                    break;
                }

                if (x % prime == 0) {
                    int exp = 0;
                    while (x % prime == 0) {
                        x /= prime;
                        exp++;
                    }
                    factorization.add(new Pair<>(prime, exp));
                }
            }

            if (x > 1) {
                factorization.add(new Pair<>(x, 1));
            }

            return factorization;
        }

    }

    static class Pair<T, U> {
        public T first;
        public U second;

        public Pair(T x, U y) {
            first = x;
            second = y;
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int readInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }
}