"""
最小公倍数
"""
def gcd(x, y):
    while y > 0:
        x,y = y,x%y
    return x

N,K = map(int, input().split())
A = list(map(int, input().split()))
A = [gcd(ai, K) for ai in A]
ans = 1
for ai in A:
    ans = ans * ai // gcd(ans, ai)
if ans == K:
    print("Yes")
else:
    print("No")