#include <bits/stdc++.h>   using namespace std;   int k, n, a;   int d[1001];   bool vis[1001], flag;   int main() {     scanf( %d%d , &n, &k);     int cut = 0;     for (int i = 2; i <= k; i++) {       if (k % i) continue;       int crt = 1;       while (k % i == 0) {         crt *= i;         k /= i;       }       d[cut++] = crt;     }     for (int i = 0; i < n; i++) {       scanf( %d , &a);       for (int j = 0; j < cut; j++) {         if (a % d[j] == 0) {           vis[j] = true;         }       }     }     flag = true;     for (int j = 0; j < cut; j++) {       flag &= vis[j];     }     if (flag)       printf( Yes n );     else       printf( No n );     return 0;   }   