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;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
int c[2000000];
set<int> C;
bool contains(long long k) {
  if (c[k]) return true;
  long long f1 = 2;
  while (f1 * f1 <= k) {
    if (k % f1 == 0) {
      long long f2 = k / f1;
      if (gcd(f1, f2) == 1 && contains(f1) && contains(f2)) return true;
    }
    f1++;
  }
  return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, k;
  cin >> n >> k;
  set<int> f;
  if (k == 1) {
    cout << "Yes\n";
    return 0;
  }
  memset((c), (0), sizeof(c));
  long long f1 = 2;
  while (f1 * f1 <= k) {
    if (k % f1 == 0) {
      long long t = 1;
      while (k % f1 == 0) {
        k /= f1;
        t *= f1;
      }
      f.insert(t);
    }
    f1++;
  }
  if (k != 1) f.insert(k);
  for (int i = 0; i < n; ++i) {
    long long x;
    cin >> x;
    c[x] = 1;
    vector<int> rem;
    for (set<int>::iterator it = f.begin(); it != f.end(); ++it) {
      if (x % (*it) == 0) rem.push_back(*it);
    }
    for (int i = 0; i < rem.size(); ++i) {
      f.erase(rem[i]);
    }
  }
  if (f.empty())
    cout << "Yes\n";
  else
    cout << "No\n";
  return 0;
}