// tested by Hightail - https://github.com/dj3500/hightail
import std.stdio, std.string, std.conv, std.algorithm;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;
import std.datetime, std.bigint;

void main() {
    int n, k;
    int[] a;

    scan(n, k);
    a = readln.split.to!(int[]);

    if (n == 1) {
        if (a[0] == k) {
            writeln("POSSIBLE");
        }
        else {
            writeln("IMPOSSIBLE");
        }

        return;
    }

    int lim = a.reduce!max;

    if (k > lim) {
        writeln("IMPOSSIBLE");
        return;
    }

    int g = gcd(a[0], a[1]);

    foreach (i ; 2 .. n) {
        g = gcd(g, a[i]);
    }

    if (k % g == 0) {
        writeln("POSSIBLE");
    }
    else {
        writeln("IMPOSSIBLE");
    }
}

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

unittest {
    assert(gcd(24, 36) == 12);
    assert(gcd(2, 5) == 1);
    assert(gcd(6, 3) == 3);
    assert(gcd(1, 100) == 1);
    assert(gcd(12, 15) == 3);
    assert(gcd(15, 12) == 3);
}
void scan(T...)(ref T args) {
    string[] line = readln.split;
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}


void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}