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>
namespace fugo {
std::vector<int> findDivisors(int x) {
  std::vector<int> divisors;
  for (int i = 1; i * i <= x; ++i) {
    if (x % i == 0) {
      divisors.push_back(i);
      if (i != x / i) {
        divisors.push_back(x / i);
      }
    }
  }
  return divisors;
}
std::vector<std::pair<int, int>> factorize(int x) {
  std::vector<std::pair<int, int>> factors;
  for (int i = 2; i * i <= x; ++i) {
    int degree = 0;
    while (x % i == 0) {
      x /= i;
      ++degree;
    }
    if (degree > 0) {
      factors.push_back(std::make_pair(i, degree));
    }
  }
  if (x != 1) {
    factors.push_back(std::make_pair(x, 1));
  }
  return factors;
}
template <typename T>
T gcd(T a, T b) {
  if (!a) {
    return b;
  }
  return gcd(b % a, a);
}
}  // namespace fugo
namespace fugo {
int mulMod(int a, int b, int mod) { return (a * 1ll * b) % mod; }
void iMulMod(int& a, int b, int mod) { a = mulMod(a, b, mod); }
int fastPow(int base, int degree, int mod) {
  int result = 1;
  while (degree) {
    if (degree & 1) {
      iMulMod(result, base, mod);
    }
    iMulMod(base, base, mod);
    degree >>= 1;
  }
  return result;
}
long long fastPow(int base, int degree) {
  long long result = 1;
  while (degree) {
    if (degree & 1) {
      result *= base;
    }
    base *= base;
    degree >>= 1;
  }
  return result;
}
}  // namespace fugo
using namespace std;
const int MAXN = 100000;
const int MOD = 1000 * 1000 * 1000 + 7;
void solve();
int main() {
  auto start = clock();
  cout.sync_with_stdio(0);
  cin.tie(0);
  cout.precision(10);
  cout << fixed;
  int t = 1;
  while (t--) {
    solve();
  }
  cerr << "\nTime: " << (clock() - start) / 1.0 / CLOCKS_PER_SEC << "\n";
  return 0;
}
void solve() {
  int n, k;
  cin >> n >> k;
  vector<int> factorValues;
  {
    auto factors = fugo::factorize(k);
    for (const auto& factor : factors) {
      factorValues.push_back(fugo::fastPow(factor.first, factor.second));
    }
  }
  vector<char> covered(factorValues.size(), false);
  for (int i = 0; i < n; ++i) {
    int a;
    cin >> a;
    for (int j = 0; j < factorValues.size(); ++j) {
      if (!covered[j]) {
        covered[j] = a % factorValues[j] == 0;
      }
    }
  }
  for (int j = 0; j < factorValues.size(); ++j) {
    if (!covered[j]) {
      cout << "No" << endl;
      return;
    }
  }
  cout << "Yes" << endl;
}