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>
#pragma comment(linker, "/STACK:250000000")
using namespace std;
class animal {
 public:
  int point;
  char direct;
  bool operator<(animal another) {
    return point + 0.1 * (direct == '-') <
           another.point + 0.1 * (another.direct == '-');
  }
};
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long pow_mod(long long x, long long a) {
  if (a == 0) return 1;
  if (a == 1) return x;
  long long res = pow_mod(x, a / 2);
  res = (res * res) % 1000000007;
  if (a % 2) res = res * x % 1000000007;
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  int n = 1, k, m;
  cin >> n >> k;
  vector<int> k_d(1009);
  vector<int> parts;
  int d = 2, dd;
  while (k > 1 && d < 1002) {
    dd = 1;
    while (k % d == 0) {
      k /= d;
      k_d[d]++;
      dd *= d;
    }
    if (k_d[d]) {
      parts.push_back(dd);
    }
    d++;
  }
  if (k > 1) parts.push_back(k);
  int c;
  for (int i = 0; i < n; ++i) {
    cin >> c;
    for (int j = 0; j < parts.size(); ++j) {
      if (c % parts[j] == 0) parts[j] = 1;
    }
  }
  bool answ = true;
  for (int j = 0; j < parts.size(); ++j) {
    answ = answ && (parts[j] == 1);
  }
  if (answ)
    cout << "Yes\n";
  else
    cout << "No\n";
  return 0;
}