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;
constexpr int inf = 1000010;
vector<int> find_primes(const int n) {
  vector<int> rez(n, 0);
  vector<bool> buf(n + 1, true);
  for (int i = 2; i < n; ++i) {
    if (buf[i]) {
      rez[i] = i;
      rez.push_back(i);
      for (int j = 2 * i; j < n; j += i) {
        rez[j] = i;
        buf[j] = false;
      }
    }
  }
  return rez;
}
int main() {
  ios_base ::sync_with_stdio(false);
  int n = 0, k = 0;
  cin >> n >> k;
  map<int, int> mp;
  vector<int> pr = find_primes(1000 * 1000 + 10);
  for (int i = 0, val; i < n; ++i) {
    int x;
    cin >> x;
    while (x > 1) {
      const int tmp = pr[x];
      int cur = 0;
      do {
        ++cur, x /= tmp;
      } while (x % tmp == 0);
      mp[tmp] = max(mp[tmp], cur);
    }
  }
  bool rez = true;
  int x = k;
  while (x > 1) {
    const int tmp = pr[x];
    int cur = 0;
    do {
      ++cur, x /= tmp;
    } while (x % tmp == 0);
    rez = (rez && cur <= mp[tmp]);
  }
  cout << (rez ? "Yes" : "No") << endl;
  return 0;
}