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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int fact[1000005];
void criba() {
  for (int i = 2; i * i < 1000005; i++) {
    if (fact[i] == 0)
      for (int j = i * i; j < 1000005; j += i) fact[j] = i;
  }
  for (int i = 2; i < 1000005; i++)
    if (fact[i] == 0) fact[i] = i;
}
int c[1000005];
int main() {
  criba();
  int n, k;
  scanf("%d%d", &n, &k);
  bool ok = false;
  for (int i = 0; i < n; i++) {
    scanf("%d", &c[i]);
    if (c[i] % k == 0) ok = true;
  }
  if (ok)
    puts("Yes");
  else {
    vector<int> f;
    while (k > 1) {
      int p = fact[k];
      int prod = 1;
      while (k % p == 0) prod *= p, k /= p;
      f.push_back(prod);
    }
    int ct = 0;
    for (int j = 0; j < f.size(); j++) {
      bool val = false;
      for (int i = 0; i < n && !val; i++)
        if (c[i] % f[j] == 0) val = true;
      if (val) ct++;
    }
    if (ct == f.size())
      puts("Yes");
    else
      puts("No");
  }
}