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 mx = 1e6;
vector<int> cnt(mx, -1);
vector<pair<int, int> > factor;
std::vector<int> prime;
void fun(int k) {
  for (int i = 2; i * i <= k and k > 1; i++) {
    if (k % i == 0) {
      prime.push_back(i);
      int c = 0;
      while (k % i == 0) {
        k /= i;
        c++;
      }
      factor.push_back({i, c});
    }
  }
  if (k != 1) factor.push_back({k, 1}), prime.push_back(k);
}
void Fun(int num) {
  for (int i = 0; i < prime.size(); i++) {
    if (num % prime[i] == 0) {
      int c = 0;
      while (num % prime[i] == 0) {
        num /= prime[i];
        c++;
      }
      cnt[prime[i]] = max(c, cnt[prime[i]]);
    }
  }
}
int main() {
  int n, k;
  scanf("%d %d", &n, &k);
  fun(k);
  for (int i = 1; i <= n; i++) {
    int x;
    scanf("%d", &x);
    Fun(x);
  }
  bool ok = true;
  for (int i = 0; i < factor.size(); i++) {
    if (cnt[factor[i].first] < factor[i].second) {
      ok = false;
      break;
    }
  }
  if (ok)
    printf("Yes\n");
  else
    printf("No\n");
  return 0;
}