Problem: Today Pari and Arya are playing a game called Remainders.

Pari chooses two positive integer x and k, and tells Arya k but not x. Arya have to find the value <image>. There are n ancient numbers c1, c2, ..., cn and Pari has to tell Arya <image> if Arya wants. Given k and the ancient values, tell us if Arya has a winning strategy independent of value of x or not. Formally, is it true that Arya can understand the value <image> for any positive integer x?

Note, that <image> means the remainder of x after dividing it by y.

Input

The first line of the input contains two integers n and k (1 ≤ n, k ≤ 1 000 000) — the number of ancient integers and value k that is chosen by Pari.

The second line contains n integers c1, c2, ..., cn (1 ≤ ci ≤ 1 000 000).

Output

Print "Yes" (without quotes) if Arya has a winning strategy independent of value of x, or "No" (without quotes) otherwise.

Examples

Input

4 5
2 3 5 12


Output

Yes


Input

2 7
2 3


Output

No

Note

In the first sample, Arya can understand <image> because 5 is one of the ancient numbers.

In the second sample, Arya can't be sure what <image> is. For example 1 and 7 have the same remainders after dividing by 2 and 3, but they differ in remainders after dividing by 7.

Solution (in PYTHON3):

Solution:
def sieze_prime(n):
    sieze = [True]*(n+1)
    sieze[0] = sieze[1] = False
    i = 2
    while i * i <= n:
        if sieze[i]:
            for j in range(2*i, n+1, i):
                sieze[j] = False
            # end for
        # end if
        i = i + 1
    # end while
    primes = range(0, n+1)
    primes = filter(lambda x : sieze[x], primes)
    return primes
# end def

def factorize(n):
    global primes
    factors = []
    i = 0;
    while primes[i]**2 <= n:
        p = primes[i]
        if n % p == 0:
            factor = [primes[i], 1]
            n //= p
            while n % p == 0:
                n //= p
                factor[1] += 1
            # end while
            factors.append(factor)
        # end if
        i += 1
    # end while
    if not n==1: factors.append([n, 1])
    return factors
# end def

primes = None

def gcd(a, b):
    if a % b == 0:
        return b
    return gcd(b, a % b)

def lcm(a, b):
    return (a * b) // gcd(a, b)


def main():
    global primes
    primes = list(sieze_prime(1000000))
    n, k = map(lambda x : int(x), input().split())
    c = set(map(lambda x : int(x), input().split()))
    factors = factorize(k)
    success = True
    for prime, power in factors:
        factor = prime**power
        if any(map(lambda x : int(x) % factor==0, c)):
            continue
        else:
            success = False
            break
    if success: print("Yes")
    else: print("No")

main()