跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1197. Remainders Game

  • ID: 1203
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:进阶
  • 上传者:
  • 中国剩余定理
  • 数学
  • 数论
  • 进阶
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Remainders Game

题目描述

B. Remainders Game
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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 c1,c2,...,cn 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.

Input

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

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

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 because 5 is one of the ancient numbers.

In the second sample, Arya can't be sure what 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.


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 670 题。保留原作者与原赛事署名。