n, k = list(map(int, input().split()))

a = list(map(int, input().split()))

a.sort()



def f(l, s):

    return s if l % s == 0 else f(s, l % s)



z = f(max(a), min(a))

for i in a:

    z = f(i, z)

if max(a) >= k and k % z == 0:

    print('POSSIBLE')

else:

    print('IMPOSSIBLE')
n, k = list(map(int, input().split()))

a = list(map(int, input().split()))

def f(l, s):

    return s if l % s == 0 else f(s, l % s)



z = f(max(a), min(a))

for i in a:

    z = f(i, z)

if max(a) >= k and k % z == 0:

    print('POSSIBLE')

else:

    print('IMPOSSIBLE')
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()


def f(l, s):
    return s if l % s == 0 else f(s, l % s)


z = f(max(a), min(a))
for i in a:
    z = f(i, z)
if max(a) >= k and k % z == 0:
    print("POSSIBLE")
else:
    print("IMPOSSIBLE")

n, k = list(map(int, input().split()))
a = list(map(int, input().split()))


def f(l, s):
    return s if l % s == 0 else f(s, l % s)


z = f(max(a), min(a))
for i in a:
    z = f(i, z)
if max(a) >= k and k % z == 0:
    print("POSSIBLE")
else:
    print("IMPOSSIBLE")

-a.sort()