# Sum of two

Very easy

Execution time limit is 1 second

Runtime memory usage limit is 128 megabytes

Given an array $A$, sorted in ascending order and containing $n$ integers. Determine whether there exists a pair of numbers $(A_{i},A_{j})$, where $i<j$, such that their sum is equal to $x$.

## Input

The first line contains two integers $n(n≤10_{5})$ and $x(x≤10_{6})$. The second line contains $n$ non-negative integers, each of which is not greater than $10_{6}$.

## Output

Print "YES" if such a pair of elements exists, and "NO" otherwise.

## Examples

Input #1

Answer #1

Input #2

Answer #2

Submissions 3K

Acceptance rate 32%