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.*;
import static java.lang.Math.*;

public class Main {
    FastScanner in;
    PrintWriter out;

    static final String FILE = "";

    static int gcd(int a, int b) {
        int c;
        while (a != 0) {
            c = a;
            a = b % a;
            b = c;
        }
        return b;
    }

    String get(int[] ms, int k) {
        int cur = 1;
        for (int i = 0; i < ms.length; i++) {
            int c = ms[i];
            c /= gcd(c, cur);
            int gc = gcd(k, c);
            k /= gc;
            cur *= gc;
        }
        return k == 1 ? "Yes" : "No";
    }

    public void solve() {
        int n = in.nextInt(), k = in.nextInt();
        int[] ms = new int[n];
        for (int i = 0; i < n; i++)
            ms[i] = in.nextInt();
        out.print(get(ms, k));

        /*int n = 10;
        Random random = new Random(13);
        for (int i = 0; i < 1000; i++) {
            int k = random.nextInt(15) + 1;
            if (i % 2 == 0) {
                int[] ms = genYes(random, n, k, 30);
                String s = get(ms, k);
                if (!s.equals("Yes")) {
                    out.println(i + " ERROR! YES waited.");
                    out.println(k);
                    for (Integer it : ms)
                        out.print(it + " ");
                    return;
                }
            } else {
                if (k != 1) {
                    int[] ms = genNo(random, n, k, 30);
                    String s = get(ms, k);
                    if (!s.equals("No")) {
                        out.println(i + " ERROR! NO waited.");
                        out.println(k);
                        for (Integer it : ms)
                            out.print(it + " ");
                        return;
                    }
                }
            }
            out.println(i + " OK");
            out.flush();
        }*/
    }

    static int[] genYes(Random rnd, int n, int k, int maxVal) {
        int[] ms = new int[n];
        int gc = 1;
        for (int i = 0; i < n - 1; i++) {
            ms[i] = rnd.nextInt(maxVal + 1);
            int tmp = ms[i] / gcd(gc, ms[i]);
            int val = gcd(k, tmp);
            k /= val;
            gc *= val;
        }
        ms[n - 1] = k * gc;
        return ms;
    }

    static int[] genNo(Random rnd, int n, int k, int maxVal) {
        int[] ms = new int[n];
        int gc = 1;
        for (int i = 0; i < n; i++) {
            while (true) {
                int val = rnd.nextInt(maxVal + 1);
                if (gcd(k, val) == k)
                    continue;
                ms[i] = val;
                k /= gcd(k, ms[i]);
                break;
            }
        }
        return ms;
    }

    public void run() {
        if (FILE.equals("")) {
            in = new FastScanner(System.in);
            out = new PrintWriter(System.out);
        } else {
            try {
                in = new FastScanner(new FileInputStream(FILE +
                        ".in"));
                out = new PrintWriter(new FileOutputStream(FILE +
                        ".out"));
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
        }
        solve();
        out.close();
    }

    public static void main(String[] args) {
        (new Main()).run();
    }

    class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        public FastScanner(InputStream is) {
            br = new BufferedReader(new InputStreamReader(is));
        }

        public String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        public String nextLine() {
            st = null;
            try {
                return br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }

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

        public long nextLong() {
            return Long.parseLong(next());
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }

        public float nextFloat() {
            return Float.parseFloat(next());
        }
    }

    class Pair<A extends Comparable<A>, B extends Comparable<B>>
            implements Comparable<Pair<A, B>> {
        public A a;
        public B b;

        public Pair(A a, B b) {
            this.a = a;
            this.b = b;
        }

        @Override
        public int compareTo(Pair<A, B> o) {
            if (o == null || o.getClass() != getClass())
                return 1;
            int cmp = a.compareTo(o.a);
            if (cmp == 0)
                return b.compareTo(o.b);
            return cmp;
        }

        @Override
        public boolean equals(Object o) {
            if (this == o) return true;
            if (o == null || getClass() != o.getClass()) return false;

            Pair<?, ?> pair = (Pair<?, ?>) o;

            if (a != null ? !a.equals(pair.a) : pair.a != null) return
                    false;
            return !(b != null ? !b.equals(pair.b) : pair.b != null);
        }
    }

    class PairInt extends Pair<Integer, Integer> {
        public PairInt(Integer u, Integer v) {
            super(u, v);
        }
    }

    class PairLong extends Pair<Long, Long> {
        public PairLong(Long u, Long v) {
            super(u, v);
        }
    }

}