Execution time limit is 1 second Runtime memory usage limit is 128 megabytes You are given a sequence of n numbers: A=(a1​,a2​,...,an​).
Determine whether there is a pair (i,j) with 1≤i,j≤n such that ai​−aj​=x.
Input
The first line contains two numbers n(2≤n≤2⋅105) and x(−109≤x≤109).
The second line contains n inegers a1​,a2​,...,an​(−109≤ai​≤109).
Output
Print Yes if there is a pair (i,j) with 1≤i,j≤n such that ai​−aj​=x, and No otherwise.
Examples