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 gcd(int a, int b) {
  while (a && b) {
    int t = a % b;
    a = b;
    b = t;
  }
  return a + b;
}
int main() {
  ios_base::sync_with_stdio(false);
  int n, k;
  cin >> n >> k;
  vector<int> cs;
  unordered_set<int> seen;
  for (int i = 0; i < n; ++i) {
    int c;
    cin >> c;
    if (seen.insert(c).second) cs.push_back(c);
  }
  vector<int> mind(1000000 + 1);
  vector<int> primes;
  for (int i = 2; i < mind.size(); ++i) {
    if (mind[i] == 0) {
      primes.push_back(i);
      mind[i] = i;
    }
    for (auto p : primes) {
      if (p > mind[i]) break;
      int pos = i * p;
      if (pos >= mind.size()) break;
      mind[pos] = p;
    }
  }
  vector<int> counts(1000000 + 1);
  int d = k;
  while (mind[d] != 0) {
    int curd = mind[d];
    counts[curd] += 1;
    d /= curd;
  }
  vector<int> mounts(1000000 + 1);
  for (auto c : cs) {
    int d = c;
    while (mind[d] != 0) {
      int curd = mind[d];
      int curcnt = 0;
      while (mind[d] == curd) {
        curcnt += 1;
        d /= curd;
      }
      mounts[curd] = max(mounts[curd], curcnt);
    }
  }
  for (int i = 0; i < counts.size(); ++i) {
    if (mounts[i] < counts[i]) {
      cout << "No" << endl;
      return 0;
    }
  }
  cout << "Yes" << endl;
  return 0;
}