import math
from functools import reduce

def compute_gcd(arr):
    def gcd(a, b):
        while b:
            a, b = b, a % b
        return a
    non_zero = [x for x in arr if x != 0]
    if not non_zero:
        return 0
    current_gcd = abs(non_zero[0])
    for num in non_zero[1:]:
        current_gcd = gcd(current_gcd, abs(num))
        if current_gcd == 1:
            break
    return current_gcd

n, k = map(int, input().split())
a = list(map(int, input().split()))

g = compute_gcd(a)

if g == 0:
    print("Yes" if k == 0 else "No")
else:
    print("Yes" if k % g == 0 else "No")