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 . There are *n* ancient numbers *c*_{1}, *c*_{2}, ..., *c*_{n} and Pari has to tell Arya 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 for any positive integer *x*?

Note, that means the remainder of *x* after dividing it by *y*.

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 *c*_{1}, *c*_{2}, ..., *c*_{n} (1 ≤ *c*_{i} ≤ 1 000 000).

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

提交代码