Gap Existence

Easy

Execution time limit is 1 second

Runtime memory usage limit is 128 megabytes

You are given a sequence of $n$ numbers: $A = (a_{1}, a_{2}, ..., a_{n})$ .

Determine whether there is a pair $(i, j)$ with $1 \leq i, j \leq n$ such that $a_{i} - a_{j} = x$ .

Input

The first line contains two numbers $n (2 \leq n \leq 2 \cdot 1 0^{5})$ and $x (- 1 0^{9} \leq x \leq 1 0^{9})$ .

The second line contains $n$ inegers $a_{1}, a_{2}, ..., a_{n} (- 1 0^{9} \leq a_{i} \leq 1 0^{9})$ .

Print Yes if there is a pair $(i, j)$ with $1 \leq i, j \leq n$ such that $a_{i} - a_{j} = x$ , and No otherwise.

Input #1

Answer #1

Input #2

Answer #2

Submissions 1K

Acceptance rate 23%