N,K=list(map(int,input().split()))

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



diffs=[]

for i in range(len(A)):

  if A[i]>=K:

    diffs.append(A[i]-K)

    

def gcd(a,b):

  if a>b:

    a,b=b,a

  while a%b>0:

    a,b=b,a%b

  return b



g=A[0]

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

  g=gcd(g,A[i])

  

for dif in diffs:

  if dif%g==0:

    print("POSSIBLE")

    break

else:

  print("IMPOSSIBLE")
import sys

readline = sys.stdin.readline



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



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



import math

from functools import reduce

g = reduce(math.gcd, a)



if k <= max(a) and k % g == 0:

  print("POSSIBLE")

else:

  print("IMPOSSIBLE")
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
diffs = []
for i in range(len(A)):
    if A[i] >= K:
        diffs.append(A[i] - K)


def gcd(a, b):
    if a > b:
        a, b = b, a
    while a % b > 0:
        a, b = b, a % b
    return b


g = A[0]
for i in range(1, len(A)):
    g = gcd(g, A[i])
for dif in diffs:
    if dif % g == 0:
        print("POSSIBLE")
        break
else:
    print("IMPOSSIBLE")

import sys

readline = sys.stdin.readline
n, k = list(map(int, readline().split()))
a = list(map(int, readline().split()))
import math
from functools import reduce

g = reduce(math.gcd, a)
if k <= max(a) and k % g == 0:
    print("POSSIBLE")
else:
    print("IMPOSSIBLE")

-N, K = list(map(int, input().split())) -A = list(map(int, input().split())) -diffs = [] -for i in range(len(A)): -    if A[i] >= K: -        diffs.append(A[i] - K) +import sys +readline = sys.stdin.readline +n, k = list(map(int, readline().split())) +a = list(map(int, readline().split())) +import math +from functools import reduce -def gcd(a, b): -    if a > b: -        a, b = b, a -    while a % b > 0: -        a, b = b, a % b -    return b - - -g = A[0] -for i in range(1, len(A)): -    g = gcd(g, A[i]) -for dif in diffs: -    if dif % g == 0: -        print("POSSIBLE") -        break +g = reduce(math.gcd, a) +if k <= max(a) and k % g == 0: +    print("POSSIBLE")