403849: GYM101341 D Jumps

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 a₁, ..., a_n in any direction. Is he able to reach x?

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

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

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

3 17
3 5 4

YES

4 5
10 20 30 40

NO