Two Elements Summing to K

Problem Background

Special for beginners, ^_^

Problem Description

In an integer sequence of length $n$ ($n \le 10^5$), determine whether there exist two elements whose sum is $k$ ($0 \le k \le 10^6$).

Input Format

The first line contains the length $n$ of the sequence and $k$, separated by a space.

The second line contains the $n$ non-negative integers of the sequence, each less than $10^5$, separated by spaces.

Output Format

If there exist two elements whose sum is $k$, output yes; otherwise output no.

Sample Input

9 10
1 2 3 4 5 6 7 8 9

Sample Output

yes

Constraints

Time limit: 1s, memory limit: 1024KiB for each test case.