#include <bits/stdc++.h>   using namespace std;   void solve() {     int n, k;     cin >> n >> k;     if (k == 1) {       cout <<  Yes  << endl;       return;     }     vector<int> divs;     for (int i = 2; i < k; ++i)       if (!(k % i)) {         cerr << i << endl;         divs.push_back(1);         while (!(k % i)) k /= i, divs.back() *= i;       }     if (k > 1) divs.push_back(k);     set<int> div(divs.begin(), divs.end());     int a;     for (int i = 0; i < n; ++i) {       cin >> a;       set<int>::iterator it = div.begin();       while (it != div.end()) {         if (a % (*it))           ++it;         else           it = div.erase(it);       }     }     if (div.size())       cout <<  No  << endl;     else       cout <<  Yes  << endl;   }   int main() {     ios_base::sync_with_stdio(false);     cin.tie();     solve();     return 0;   }   