403849: GYM101341 D Jumps

Memory Limit：256 MB Time Limit：2 S
Judge Style：Text Compare Creator：
Submit：0 Solved：0

Description

D. Jumpstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output

A frog lives in a one-dimensional world in the point with the coordinate 0. He needs to get to the point with the coordinate x. For some reason he cannot make jumps of arbitrary length, and can jump only by a1, ..., an in any direction. Is he able to reach x?

Input

The first line contains two integers n and x separated by a space (1 ≤ n ≤ 200000,  - 109 ≤ x ≤ 109) — the number of variants of jump length and the coordinate of the point to reach.

The second line contains n integers ai separated by spaces (1 ≤ ai ≤ 109) — the lengths of jumps the frog can make.

Output

Output «YES» (without quotes), if the frog can reach the point x, otherwise output «NO» (without quotes).

ExamplesInput
3 17
3 5 4
Output
YES
Input
4 5
10 20 30 40
Output
NO

Source/Category

加入题单

上一题 下一题 算法标签：