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;
inline long long Rd() {
  long long x = 0;
  int ch = getchar(), f = 1;
  while (!isdigit(ch) && (ch != '-') && (ch != EOF)) ch = getchar();
  if (ch == '-') {
    f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = (x << 1) + (x << 3) + ch - '0';
    ch = getchar();
  }
  return x * f;
}
inline void Rt(long long x) {
  if (x < 0) putchar('-'), x = -x;
  if (x >= 10)
    Rt(x / 10), putchar(x % 10 + '0');
  else
    putchar(x + '0');
}
const int MAXC = 1000005;
int Maxc, Mn[MAXC], P[MAXC / 10], Cnt, Lm[MAXC / 10], n, k, c[MAXC];
int main() {
  n = Rd(), Maxc = k = Rd();
  for (int i = 1; i <= (int)n; i++) c[i] = Rd(), Maxc = max(Maxc, c[i]);
  for (int i = 2; i <= (int)Maxc; i++) {
    if (!Mn[i]) Mn[i] = ++Cnt, P[Cnt] = i;
    for (int j = 1; j <= (int)Cnt; j++) {
      if (P[j] * i > Maxc) break;
      Mn[P[j] * i] = j;
      if (j == Mn[i]) break;
    }
  }
  for (int i = 1; i <= (int)n; i++)
    while (c[i] != 1) {
      int Nw = Mn[c[i]], Cs = 0;
      while (Mn[c[i]] == Nw) {
        Cs++, c[i] /= P[Mn[c[i]]];
      }
      Lm[Nw] = max(Lm[Nw], Cs);
    }
  while (k != 1) {
    int Nw = Mn[k], Cs = 0;
    while (Mn[k] == Nw) {
      Cs++, k /= P[Mn[k]];
    }
    if (Cs > Lm[Nw]) return puts("No"), 0;
  }
  puts("Yes");
}