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 MOD = 1000000007;
const double EXP = 2.7182818284590452;
const double Pi = 3.1415926535;
const long double EPS = 1e-9;
const int INF = 1000 * 1000 * 1001;
const long long INFL = (long long)INF * (long long)INF;
long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  while (b != 0) {
    a %= b;
    swap(a, b);
  }
  return a;
}
long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
long long extgcd(long long a, long long b, long long& x, long long& y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  }
  long long x11, y11;
  long long d = extgcd(b % a, a, x11, y11);
  x = y11 - (b / a) * x11;
  y = x11;
  return d;
}
unsigned long long poww(unsigned long long v, unsigned long long p,
                        unsigned long long mod) {
  if (p == 0) return 1;
  if (p & 1) {
    return (poww(v, p - 1, mod) * v) % mod;
  } else {
    unsigned long long t = poww(v, p / 2, mod);
    return (t * t) % mod;
  }
}
const unsigned long long L31018 = 3000000000000000000L;
const unsigned long long L1018 = 1000000000000000000L;
int n, k, c;
long long l = 1;
void accept() {
  cin >> n >> k;
  for (int i = (0); i < (n); ++i) {
    scanf("%d", &c);
    l = lcm(l, c);
    l = gcd(l, k);
    if (l == k) {
      cout << "Yes";
      return;
    }
  }
  cout << "No";
}
const char inputFile[] = "busy_day.in";
int main(void) {
  accept();
  return 0;
}