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 = 1000000;
int n, m, pri[maxn + 10], sum, vis[maxn + 10], mx[maxn + 10];
void init() {
  int first, s, second;
  sum = 0;
  for (int i = 2; i <= maxn; i++) {
    if (!vis[i]) pri[++sum] = i, vis[i] = i;
    for (int j = 1; j <= sum && i * pri[j] <= maxn; j++) {
      vis[i * pri[j]] = pri[j];
      if (i % pri[j] == 0) break;
    }
  }
  memset(pri, 0, sizeof(pri));
  memset(mx, 0, sizeof(mx));
  while (n--) {
    scanf("%d", &first);
    while (first > 1) {
      second = vis[first];
      s = 0;
      while (first % second == 0) {
        first /= second;
        s++;
      }
      mx[second] = max(mx[second], s);
    }
  }
}
void work() {
  int s = 0;
  for (int i = 2; i <= m; i++)
    if (m % i == 0) {
      s = 0;
      while (m % i == 0) m /= i, s++;
      if (s > mx[i]) {
        puts("No");
        return;
      }
    }
  puts("Yes");
}
int main() {
  while (cin >> n >> m) {
    init();
    work();
  }
  return 0;
}