#include <iostream>
#include <algorithm>
using namespace std;

int gcd(int a,int b){return b==0 ? a : gcd(b,a%b);}

int main(){
	int n,k,tmp;
	cin>>n>>k;
	int MAX=0,G=0;
	for(int i=1;i<=n;i++){
		cin>>tmp;
		G=gcd(G,tmp);
		MAX=max(MAX,tmp);
	} 	
	if(k<=MAX&&k%G==0) cout<<"POSSIBLE"<<endl;
	else cout<<"IMPOSSIBLE"<<endl;
	return 0;
}