import sys

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

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



a.sort()

if a[-1] < k:

    print('IMPOSSIBLE')

    sys.exit(0)



seta = set(a)

if k in seta:

    print('POSSIBLE')

    sys.exit(0)

lena = len(seta)

sorteda = sorted(seta)

mini = sorteda[0] if sorteda[0] != 0 else sorteda[1]

for i in range(1, len(sorteda)):

    seta.add(sorteda[i] % mini)



sorteda = sorted(seta)



mini = sorteda[0] if sorteda[0] != 0 else sorteda[1]



if k % mini == 0:

    print('POSSIBLE')

    sys.exit(0)

print('IMPOSSIBLE')
import sys

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

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

a.sort()

if a[-1] < k:

    print('IMPOSSIBLE')

    sys.exit(0)



seta = set(a)

if k in seta:

    print('POSSIBLE')

    sys.exit(0)



def gojoho(l, s):

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



koubaisu = gojoho(a[1], a[0])

for i in a:

    koubaisu = gojoho(i, koubaisu)



if k % koubaisu == 0:

    print('POSSIBLE')

else:

    print('IMPOSSIBLE')
import sys

n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
if a[-1] < k:
    print("IMPOSSIBLE")
    sys.exit(0)
seta = set(a)
if k in seta:
    print("POSSIBLE")
    sys.exit(0)
lena = len(seta)
sorteda = sorted(seta)
mini = sorteda[0] if sorteda[0] != 0 else sorteda[1]
for i in range(1, len(sorteda)):
    seta.add(sorteda[i] % mini)
sorteda = sorted(seta)
mini = sorteda[0] if sorteda[0] != 0 else sorteda[1]
if k % mini == 0:
    print("POSSIBLE")
    sys.exit(0)
print("IMPOSSIBLE")

import sys

n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
if a[-1] < k:
    print("IMPOSSIBLE")
    sys.exit(0)
seta = set(a)
if k in seta:
    print("POSSIBLE")
    sys.exit(0)


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


koubaisu = gojoho(a[1], a[0])
for i in a:
    koubaisu = gojoho(i, koubaisu)
if k % koubaisu == 0:
    print("POSSIBLE")
else:
    print("IMPOSSIBLE")

-lena = len(seta) -sorteda = sorted(seta) -mini = sorteda[0] if sorteda[0] != 0 else sorteda[1] -for i in range(1, len(sorteda)): -    seta.add(sorteda[i] % mini) -sorteda = sorted(seta) -mini = sorteda[0] if sorteda[0] != 0 else sorteda[1] -if k % mini == 0: + + +def gojoho(l, s): +    return s if l % s == 0 else gojoho(s, l % s) + + +koubaisu = gojoho(a[1], a[0]) +for i in a: +    koubaisu = gojoho(i, koubaisu) +if k % koubaisu == 0: -    sys.exit(0) -print("IMPOSSIBLE") +else: +    print("IMPOSSIBLE")