def factorization(n):
    a = n
    p = 2
    D = {}
    while a != 1:
        cnt = 0
        while a % p == 0:
            cnt += 1
            a //= p
        if cnt:
            D[p] = cnt
        p += 1
        if p * p > n and a != 1:
            D[a] = 1
            break
    return D

N, H = map(int, input().split())
A = list(map(int, input().split()))
D = factorization(H)
flg = True
if 0 in A:
    print("YES")
else:
    for i in D:
        cnt = 0
        for j in range(N):
            while A[j] % i == 0:
                cnt += 1
                A[j] //= i
        if cnt < D[i]:
            flg = False
            break
    if flg:
        print("YES")
    else:
        print("NO")