from sys import stdin


def prime_factors(n):
    ret = []
    apnd = ret.append
    while n >= 4:
        if n % 2:
            break
        else:
            n //= 2
            apnd(2)
    i = 3
    while n >= i * i:
        if n % i:
            i += 2
        else:
            n //= i
            apnd(i)
    apnd(n)
    return ret


def main():
    input = lambda: stdin.readline()[:-1]
    N, H = map(int, input().split())
    A = set(map(int, input().split()))

    primes = set(prime_factors(H))
    for p in primes:
        for a in A:
            if not a % p:
                break
        else:
            print("NO")
            return
    print("YES")


main()