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 int MAXN = 1e6 + 10;
int cnt[MAXN];
int n, k;
bool read() {
  if (scanf("%d%d", &n, &k) < 2) {
    return false;
  }
  memset(cnt, 0, sizeof cnt);
  for (int i = 0; i < (int)n; ++i) {
    int c;
    scanf("%d", &c);
    ++cnt[c];
  }
  return true;
}
bool pr[MAXN];
int deg(int x, int p) {
  int ans = 0;
  while (x % p == 0) {
    x /= p;
    ++ans;
  }
  return ans;
}
void precalc() {
  memset(pr, true, sizeof pr);
  for (int i = 2; i < MAXN; ++i) {
    if (pr[i]) {
      for (int j = i + i; j < MAXN; j += i) {
        pr[j] = false;
      }
    }
  }
}
int max_deg[MAXN];
bool solve() {
  memset(max_deg, 0, sizeof max_deg);
  for (int p = 2; p < MAXN; ++p) {
    if (!pr[p]) {
      continue;
    }
    for (int c = p; c < MAXN; c += p) {
      if (cnt[c]) {
        max_deg[p] = max(max_deg[p], deg(c, p));
      }
    }
  }
  for (int p = 2; p <= k; ++p) {
    if (!pr[p]) {
      continue;
    }
    int d = deg(k, p);
    if (d > max_deg[p]) {
      return false;
    }
  }
  return true;
}
int main() {
  precalc();
  while (read()) {
    puts(solve() ? "Yes" : "No");
  }
  return 0;
}