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;
const long long INF = 1e18;
const int MOD = 1e9 + 7;
const int N = 1e6 + 2000;
long long prime[N + 1], cntprime[N + 1];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, m, h, flag = 0, k;
  cin >> n >> k;
  long long c[n + 2], cnt = 0;
  for (int i = 0; i < n; i++) cin >> c[i];
  for (int i = 2; i <= N - 1; i++) {
    if (!prime[i])
      for (int j = i; j < N; j += i) prime[j] = i;
  }
  for (int i = 0; i < n; i++) {
    while (c[i] > 1) {
      long long p = prime[c[i]];
      cnt = 0;
      while (c[i] % p == 0) {
        cnt++;
        c[i] /= p;
      }
      cntprime[p] = max(cntprime[p], cnt);
    }
  }
  while (k > 1) {
    if (cntprime[prime[k]] <= 0) {
      flag = 1;
      break;
    }
    cntprime[prime[k]]--;
    k /= prime[k];
  }
  cout << (flag ? "NO\n" : "YES\n");
}