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 LIM = 1000000;
int etf[1000010];
int factor[1000010];
int inp[1000006];
int powers[1000006];
void precomp() {
  int i, j;
  for (i = 1; i <= LIM; i++) etf[i] = i, factor[i] = i;
  for (i = 2; i <= LIM; i++)
    if (etf[i] == i)
      for (j = 2 * i; j <= LIM; j += i)
        etf[j] = etf[j] - (etf[j] / i), factor[j] = i;
  for (i = 2; i <= LIM; i++)
    if (etf[i] == i) etf[i] = i - 1;
}
int main() {
  precomp();
  int n, k;
  scanf("%d", &n);
  scanf("%d", &k);
  for (int i = 0; i < n; i++) scanf("%d", &inp[i]);
  memset(powers, 0, sizeof powers);
  for (int i = 0; i < n; i++) {
    int curr = inp[i];
    while (curr != 1) {
      int f = factor[curr], cnt = 0;
      while (curr % f == 0) curr /= f, cnt++;
      powers[f] = max(powers[f], cnt);
    }
  }
  int mod = 1 % k;
  for (int i = 1; i <= 1000000; i++)
    for (int j = 0; j < powers[i]; j++) mod = (mod * 1LL * i) % k;
  if (mod == 0)
    cout << "Yes\n";
  else
    cout << "No\n";
  return 0;
}