import std.algorithm;
import std.array;
import std.ascii;
import std.bigint;
import std.complex;
import std.container;
import std.conv;
import std.functional;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;

auto readInts() {
	return array(map!(to!int)(readln().strip().split()));
}
auto readInt() {
	return readInts()[0];
}
auto readLongs() {
	return array(map!(to!long)(readln().strip().split()));
}
auto readLong() {
	return readLongs()[0];
}

void readlnTo(T...)(ref T t) {
    auto s = readln().split();
    assert(s.length == t.length);
    foreach(ref ti; t) {
        ti = s[0].to!(typeof(ti));
        s = s[1..$];
    }
}

const real eps = 1e-10;

const long p = 1_000_000_000 + 7;

long gcd(long a, long b) {
    if(a > b) {
        swap(a, b);
    }
    if(b%a == 0) {
        return a;
    }
    return gcd(b%a, a);
}

bool test(long[] a, long k, long GCD) {
    if(reduce!max(0L, a) < k) {
        return false;
    }
    if(a.any!(x => x == k)) {
        return true;
    }
    if(a.length > 2 && GCD == 1) {
        return true;
    }
    return false;
}

void main(){
    long n, k;
    readlnTo(n, k);
    auto a = readLongs();
    a.sort();
    a = a.uniq().array();
    auto GCD = reduce!gcd(a[0], a);
    auto kGCD = gcd(k, GCD);
    k /= kGCD;
    a[] /= kGCD;
    GCD /= kGCD;
    writeln(test(a, k, GCD) ? "POSSIBLE": "IMPOSSIBLE");
}

