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 MAXN = 1000010;
int n, k;
int C[MAXN];
void load() {
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; i++) scanf("%d", C + i);
}
bool A[MAXN];
int previ[MAXN];
int nexti[MAXN];
int last[MAXN];
void sito() {
  int x = 2;
  for (int i = 0; i < MAXN; i++) A[i] = true;
  while (x * x <= MAXN) {
    int y = MAXN - 1;
    while (y != x) {
      y = previ[y];
      long long z = (long long)x * y;
      if (z >= MAXN) continue;
      last[z] = x;
      nexti[previ[z]] = nexti[z];
      previ[nexti[z]] = previ[z];
      A[z] = false;
    }
    x = nexti[x];
  }
}
int CFactors[MAXN];
bool solve() {
  for (int i = 1; i < MAXN; i++) {
    previ[i] = i - 1;
    nexti[i] = i + 1;
  }
  sito();
  for (int i = 0; i < MAXN; i++)
    if (A[i]) last[i] = i;
  for (int i = 0; i < n; i++) {
    int c = C[i];
    while (c > 1) {
      int l = last[c];
      int br = 0;
      while (c % l == 0) {
        br++;
        c /= l;
      }
      CFactors[l] = max(CFactors[l], br);
    }
  }
  while (k > 1) {
    int l = last[k];
    int br = 0;
    while (k % l == 0) {
      br++;
      k /= l;
    }
    if (br > CFactors[l]) return false;
  }
  return true;
}
int main() {
  load();
  if (solve())
    printf("Yes\n");
  else
    printf("No\n");
  return 0;
}