#include<cstdio>
#include<algorithm>
using namespace std;
int n,x,i,k,tmp=0,mx=0;
int gcd(int a,int b){return b==0?a:gcd(b,a%b);}
int main()
{
	scanf("%d%d",&n,&k);
	for(i=1;i<=n;i++)scanf("%d",&x),tmp=gcd(tmp,x),mx=max(mx,x);
	if(k%tmp==0&&k<=mx)printf("POSSIBLE\n");
	else printf("IMPOSSIBLE\n"); 
	return 0;
} 