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 <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/fddd3bb34fa9f786754485afa55927f021d74d15.png" style="max-width: 100.0%;max-height: 100.0%;"/>. There are *n* ancient numbers *c*<sub class="lower-index">1</sub>, *c*<sub class="lower-index">2</sub>, ..., *c*<sub class="lower-index">*n*</sub> and Pari has to tell Arya <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/fbb55ab61f79d427b1a3d23470b55aa433de55e7.png" style="max-width: 100.0%;max-height: 100.0%;"/> 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 <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/fddd3bb34fa9f786754485afa55927f021d74d15.png" style="max-width: 100.0%;max-height: 100.0%;"/> for any positive integer *x*?

Note, that <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/f58f159973d4609d919286c1821e69cd34d81118.png" style="max-width: 100.0%;max-height: 100.0%;"/> 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*<sub class="lower-index">1</sub>, *c*<sub class="lower-index">2</sub>, ..., *c*<sub class="lower-index">*n*</sub> (1 ≤ *c*<sub class="lower-index">*i*</sub> ≤ 1 000 000).
In the first sample, Arya can understand <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/d170efffcde0907ee6bcf32de21051bce0677a2c.png" style="max-width: 100.0%;max-height: 100.0%;"/> because 5 is one of the ancient numbers.

In the second sample, Arya can't be sure what <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/57b5f6a96f5db073270dd3ed4266c69299ec701d.png" style="max-width: 100.0%;max-height: 100.0%;"/> 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.
4 5
2 3 5 12
Yes
2 7
2 3
No
1 6
8
No
2 3
9 4
Yes
4 16
19 16 13 9
Yes
5 10
5 16 19 9 17
Yes
11 95
31 49 8 139 169 121 71 17 43 29 125
No
17 71
173 43 139 73 169 199 49 81 11 89 131 107 23 29 125 152 17
No
13 86
41 64 17 31 13 97 19 25 81 47 61 37 71
No
15 91
49 121 83 67 128 125 27 113 41 169 149 19 37 29 71
Yes
2 4
2 2
No
14 87
1619 1619 1619 1619 1619 1619 1619 1619 1619 1619 1619 1619 1619 1619
No
12 100
1766 1766 1766 1766 1766 1766 1766 1766 1766 1766 1766 1766
No
1 994619
216000
No
1 651040
911250
No
1 620622
60060
No
1 1
559872
Yes
88 935089
967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967 967
No
93 181476
426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426 426
No
91 4900
630 630 70 630 910 630 630 630 770 70 770 630 630 770 70 630 70 630 70 630 70 630 630 70 910 630 630 630 770 630 630 630 70 910 70 630 70 630 770 630 630 70 630 770 70 630 70 70 630 630 70 70 70 70 630 70 70 770 910 630 70 630 770 70 910 70 630 910 630 70 770 70 70 630 770 630 70 630 70 70 630 70 630 770 630 70 630 630 70 910 630
No
61 531012
698043 698043 698043 963349 698043 698043 698043 963349 698043 698043 698043 963349 698043 698043 698043 698043 966694 698043 698043 698043 698043 698043 698043 636247 698043 963349 698043 698043 698043 698043 697838 698043 963349 698043 698043 966694 698043 698043 698043 698043 698043 698043 698043 698043 698043 698043 698043 698043 698043 698043 698043 698043 698043 698043 963349 698043 698043 698043 698043 963349 698043
No
1 216000
648000
Yes
2 8
4 4
No
3 8
4 4 4
No
2 8
2 4
No
3 12
2 2 3
No
10 4
2 2 2 2 2 2 2 2 2 2
No
10 1024
1 2 4 8 16 32 64 128 256 512
No
3 24
2 2 3
No
1 8
2
No
2 9
3 3
No
3 4
2 2 2
No
3 4
1 2 2
No
1 4
2
No
1 100003
2
No
1 2
12
Yes
2 988027
989018 995006
Yes
3 9
3 3 3
No
1 49
7
No
2 600000
200000 300000
Yes
3 8
2 2 2
No
7 510510
524288 531441 390625 823543 161051 371293 83521
Yes
2 30
6 10
Yes
2 27000
5400 4500
Yes
3 8
1 2 4
No
4 16
2 2 2 2
No
2 16
4 8
No
2 8
4 2
No
3 4
2 2 3
No
1 8
4
No
1 999983
2
No
3 16
2 4 8
No
2 216
12 18
No
2 16
8 8
No
2 36
18 12
Yes
2 36
12 18
Yes
2 1000000
1000000 1000000
Yes
3 20
2 2 5
No
1 2
6
Yes
4 4
2 3 6 5
No
1 2
1
No
1 6
6
Yes
2 16
4 4
No
2 3779
1 2
No
2 8
4 12
No
2 24
4 6
No
1 1
5
Yes
10 255255
1000000 700000 300000 110000 130000 170000 190000 230000 290000 310000
Yes
2 1000
500 2
No
4 8
2 2 2 2
No
1 666013
1
No
1 999983
1
No
1 125
5
No
2 32
4 8
No
3 32
2 4 8
No
3 8
2 4 11
No
1 32
2
No
4 4
2 2 2 2
No
8 32
2 2 2 2 2 2 2 2
No
3 24
2 4 3
No
2 4
2 6
No
2 24
6 4
No
1 20998
2
No
1 1
1
Yes
2 20998
2 10499
Yes
1 5
1
No
2 25
5 5
No
5 2
2 2 2 2 2
Yes
3 12
2 3 6
No
1 1
3
Yes
2 16
8 4
No
40 10
2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2
No
# import sys 
# sys.stdin = open('input.txt', 'r')  
# sys.stdout = open('output.txt', 'w')
import math

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

def getLCM(a,b):
	return (a*b)//math.gcd(a,b)

found = False
lc = c[0]
for i in range(1,n):
	lc = getLCM(lc,c[i])

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