#include<bits/stdc++.h>
using namespace std;
int i,n,k,a[100000];
int gcd(int x,int y){return y?gcd(y,x%y):x;}
int main(){
  int maxa=0,g=0;
  cin>>n>>k;
  for(i=0;i<n;i++){
    cin>>a[i];
    maxa=max(maxa,a[i]);
    g=gcd(g,a[i]);
  }
  if(k%g==0 && maxa>=k) cout<<"POSSIBLE"<<endl;
  else cout<<"IMPOSSIBLE"<<endl;
  return 0;

}
