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>
int gcd(int a, int b) {
  if (b == 0) return a;
  a %= b;
  return gcd(b, a);
}
const int N = 1000010;
bool flag[N];
int q[N];
int qnum;
int dnum[N];
int a[N];
void devide(int a) {
  int p = 0;
  while (a > 1) {
    while (a % q[p] == 0) {
      a /= q[p];
      dnum[p]++;
    }
    p++;
  }
}
void undevide(int a) {
  int p = 0;
  while (a > 1) {
    while (a % q[p] == 0) {
      a /= q[p];
      dnum[p]--;
    }
    p++;
  }
}
int main() {
  memset(flag, 0, sizeof(flag));
  qnum = 0;
  for (int i = 2; i < N; i++) {
    if (!flag[i]) {
      q[qnum] = i;
      qnum++;
      for (int j = i; j < N; j += i) flag[j] = 1;
    }
  }
  int n, k;
  while (scanf("%d %d", &n, &k) != EOF) {
    memset(dnum, 0, sizeof(dnum));
    undevide(k);
    for (int i = 0; i < n; i++) {
      scanf("%d", &a[i]);
    }
    int yes = 1;
    for (int i = 0; i < qnum; i++) {
      if (dnum[i] < 0) {
        for (int j = 0; j < n; j++) {
          int tmp = 0;
          while (a[j] % q[i] == 0 && dnum[i] + tmp < 0) {
            a[j] /= q[i];
            tmp++;
          }
          if (dnum[i] + tmp == 0) {
            dnum[i] = 0;
            break;
          }
        }
        if (dnum[i] < 0) {
          puts("No");
          yes = 0;
          break;
        }
      }
    }
    if (yes) puts("Yes");
  }
  return 0;
}