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;
int n, k, total;
int prime[105], p = 0, cnt[105], flag[105];
void findfactor() {
  int temp = k;
  for (int i = 2, t = int(sqrt(k)); i <= t; i++) {
    if (temp % i == 0) {
      prime[++p] = i;
      cnt[p] = 0;
      flag[p] = 0;
      while (temp % i == 0) {
        temp /= i;
        cnt[p]++;
      }
      t = int(sqrt(temp));
    }
  }
  if (temp != 0) {
    prime[++p] = temp;
    cnt[p] = 1;
    flag[p] = 0;
  }
  return;
}
void solve(int x) {
  for (int i = 1; i <= p; i++) {
    if (flag[i]) continue;
    bool can = 1;
    for (int j = 1; j <= cnt[i]; j++) {
      if (x % prime[i] == 0) {
        x /= prime[i];
      } else {
        can = 0;
        break;
      }
    }
    if (can) {
      flag[i] = 1;
      total--;
    }
  }
  return;
}
int main() {
  scanf("%d%d", &n, &k);
  findfactor();
  total = p;
  for (int i = 1, now; i <= n; i++) {
    scanf("%d", &now);
    solve(now);
    if (total == 0) {
      puts("Yes");
      return 0;
    }
  }
  puts("No");
  return 0;
}