Justin didn't write his task statement. Tsk tsk tsk. Therefore Jono will have to cure his own depression.

Jono has an array of integers $ a_1, a_2, \ldots, a_N $. Apparently, his depression will be cured if the product of $ a $, i.e. $ a_1 \times a_2 \times \ldots \times a_N $, is divisible by $ K $.

What an brief yet interesting task statement! I sure am not writing this task statement 2 hours before the contest.

Input

The first line of input consists of two integers $ N $ and $ K $.
The second line of input consists of $ N $ integers, $ a_1, a_2, \ldots, a_N $.

Output

Output Yes if the product of $ a $ is divisible by $ K $. Otherwise, output No.

Constraints

Subtask 1 (20%): $ 1 \le N, K, a_i \le 10^4 $
Subtask 2 (80%): $ 1 \le N \le 10^5 $; $ 1 \le K, a_i \le 10^9 $