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 mod = 1000000000 + 7;
long long powe(long long x, long long y) {
  x = x % mod, y = y % (mod - 1);
  long long ans = 1;
  while (y > 0) {
    if (y & 1) {
      ans = (1ll * x * ans) % mod;
    }
    y >>= 1;
    x = (1ll * x * x) % mod;
  }
  return ans;
}
void fun() {}
long long a[1000001];
signed main() {
  fun();
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n, k, num;
  cin >> n >> k;
  set<long long> s;
  long long x = k;
  for (long long i = 2; i * i <= k; i++) {
    if (k % i == 0) {
      s.insert(i);
      while (k % i == 0) {
        k /= i;
      }
    }
  }
  if (k > 1) s.insert(k);
  k = x;
  a[1] = 1;
  for (long long i = 0; i < n; i++) {
    cin >> num;
    for (auto i : s) {
      long long cnt = 0;
      while (num % i == 0) {
        num /= i;
        cnt++;
      }
      a[i] = max(a[i], cnt);
    }
    a[num] = max(1ll, a[num]);
  }
  for (long long i = 2; i * i <= k; i++) {
    long long cnt = 0;
    while (k % i == 0) {
      k /= i;
      cnt++;
    }
    if (a[i] < cnt) {
      cout << "No"
           << "\n";
      return 0;
    }
  }
  if (a[k] < 1) {
    cout << "No";
    return 0;
  }
  cout << "Yes";
}