def prime_de(number):
    factor = []
    div = 2
    while div*div <= number:
        cnt = 0
        while number % div == 0:
            cnt += 1
            number //= div
        if cnt != 0:
            factor.append([div, cnt])
        div += 1
    if number > 1:
        factor.append([number, 1])
    return factor

N, H = map(int, input().split())

X = prime_de(H)
A = list(map(int, input().split()))
if 0 in A:
    print("YES")
else:
    for a in A:
        for i in range(len(X)):
            x = X[i][0]
            while X[i][1]:
                if a%x==0:
                    a//=x
                    X[i][1] -= 1
                else:
                    break
    cc = 0
    for x, c in X:
        cc += c
    if cc == 0:
        print("YES")
    else:
        print("NO")