Number Replacement

Problem Description

Xiaoyang has a sequence $A$ of $n$ numbers, i.e. $A=[a_1,a_2,\ldots,a_n]$. He wants to replace every number greater than $k$ with the maximum value of the sequence, and every number less than $k$ with the minimum value of the sequence. Please compute the resulting sequence after the replacement.

Input Format

The first line contains two positive integers $n, k$, as described.

The second line contains $n$ numbers, representing the sequence $A$.

Output Format

Output $n$ integers, representing the result after replacement.

Sample Input

5 0
-2 -1 0 1 2

Sample Output

-2 -2 0 2 2

Sample Explanation

In the sample, $A=[-2,-1,0,1,2]$, the maximum is $2$ and the minimum is $-2$. The numbers greater than $k=0$ are $1$ and $2$, both replaced by the maximum $2$; the numbers less than $k=0$ are $-2$ and $-1$, both replaced by the minimum $-2$; the number equal to $k$, which is $0$, stays unchanged. So the resulting sequence is $[-2,-2,0,2,2]$.

Constraints

For all data, $1 \le n \le 10^5$, $|k|, |a_i| \le 10^5$.