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


(n, h), a = [[*map(int, input().split())] for _ in range(2)]

for ai in a:
    if ai == 0:
        h = 1
        break
    h //= gcd(h, ai)

print("Yes" if h == 1 else "No")