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;
inline int add(int a, int b, int m = 1000000007) {
  a += b;
  if (a >= m) a -= m;
  return a;
}
inline int mul(int a, int b, int m = 1000000007) {
  return (int)(((long long)a * (long long)b) % m);
}
inline long long getMin(long long a, long long b) { return a > b ? b : a; }
inline long long getMax(long long a, long long b) { return a > b ? a : b; }
inline long long getMid(long long a, long long b) { return a + (b - a) / 2; }
long long getGcd(long long a, long long b) {
  if (a > b) {
    long long temp = a;
    a = b;
    b = temp;
  }
  if (a == 0) return b;
  if (a == 1) return 1;
  return getGcd(a, b % a);
}
int main() {
  long long n, k;
  scanf("%I64d%I64d", &n, &k);
  long long lcm = 1;
  long long temp;
  scanf("%I64d", &temp);
  lcm = temp;
  for (long long i = 0; i <= n - 2; ++i) {
    scanf("%I64d", &temp);
    long long gcd = getGcd(lcm, temp);
    lcm *= temp;
    lcm /= gcd;
    long long gcd2 = getGcd(lcm, k);
    lcm = gcd2;
  }
  if (lcm % k == 0) {
    cout << "YES" << endl;
  } else {
    cout << "NO" << endl;
  }
  return 0;
}