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>
inline long long Input() {
  long long ret = 0;
  bool isN = 0;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') isN = 1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    ret = ret * 10 + c - '0';
    c = getchar();
  }
  return isN ? -ret : ret;
}
inline void Output(long long x) {
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  int len = 0, data[25];
  while (x) {
    data[len++] = x % 10;
    x /= 10;
  }
  if (!len) data[len++] = 0;
  while (len--) putchar(data[len] + 48);
  putchar('\n');
}
#pragma comment(linker, "/STACK:124000000,124000000")
const long double PI = acos(-1.0);
using namespace std;
bool flag[1000005];
int pri[1000005], t;
void pre() {
  t = 0;
  memset(flag, 0, sizeof(flag));
  for (int i = 2; i < 1000005; i++) {
    if (!flag[i]) pri[t++] = i;
    for (int j = 0; j < t && i * pri[j] < 1000005; j++) {
      flag[i * pri[j]] = 1;
      if (i % pri[j] == 0) break;
    }
  }
}
int main() {
  int n, k;
  pre();
  scanf("%d%d", &n, &k);
  memset(flag, 0, sizeof(flag));
  for (int i = 1; i <= n; i++) {
    int x;
    scanf("%d", &x);
    flag[x] = 1;
  }
  for (int i = 2; i <= k; i++)
    for (int j = i + i; j <= 1000005; j += i) flag[i] |= flag[j];
  bool ans = 1;
  for (int i = 0; i < t && k > 1; i++) {
    if (k % pri[i] == 0) {
      int tmp = 1;
      while (k % pri[i] == 0) {
        tmp = tmp * pri[i];
        k = k / pri[i];
      }
      if (!flag[tmp]) {
        ans = 0;
        break;
      }
    }
  }
  printf("%s\n", ans ? "Yes" : "No");
  return 0;
}