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;
const int UNDEF = -1;
const int INF = 1 << 30;
template <typename T>
inline bool chkmax(T &a, T b) {
  return a < b ? a = b, true : false;
}
template <typename T>
inline bool chkmin(T &a, T b) {
  return a > b ? a = b, true : false;
}
const int MAXN = 1000000 + 4;
const int MAXP = MAXN;
bool sieve_array[MAXP + 1];
int sp[MAXP + 1];
vector<int> pv;
void sieve() {
  for (int i = 0; i <= MAXP; i++) {
    sieve_array[i] = true;
    sp[i] = INF;
  }
  sieve_array[0] = false;
  sieve_array[1] = false;
  int lim = sqrt(MAXP) + 1;
  for (int i = 2; i <= lim; i++) {
    if (sieve_array[i]) {
      for (int j = i * i; j <= MAXP; j += i) {
        sieve_array[j] = false;
        chkmin(sp[j], i);
      }
    }
  }
  for (int i = 2; i <= MAXP; i++) {
    if (sieve_array[i]) {
      chkmin(sp[i], i);
    }
  }
}
int c[MAXN];
int fk[MAXN];
int main() {
  sieve();
  int n, k;
  scanf("%d %d", &n, &k);
  for (int i = 0; i < n; i++) scanf("%d", &c[i]);
  for (int i = 0; i < MAXN; i++) fk[i] = 0;
  while (k > 1) {
    int p = sp[k];
    fk[p]++;
    k /= p;
  }
  for (int i = 0; i < n; i++) {
    int x = c[i];
    int curp = INF;
    int cnt = 0;
    while (1) {
      int p = sp[x];
      if (p != curp) {
        if (curp != INF) {
          if (fk[curp] <= cnt) fk[curp] = 0;
        }
        cnt = 0;
        curp = p;
      }
      if (p == INF) break;
      cnt++;
      x /= p;
    }
  }
  for (int i = 0; i < MAXN; i++) {
    if (fk[i] != 0) {
      printf("No\n");
      return 0;
    }
  }
  printf("Yes\n");
}