Problem Statement

You are given a permutation $P$ of $1, 2, \cdots, N$.

You can divide $P$ into exactly $K$ non-empty contiguous subsequences as you like.

Maroon will rearrange those subsequences you make and concatenate them to make a new permutation $Q$. Here, he will lexicographically maximize $Q$.

You want to divide $P$ in a way that lexicographically minimizes $Q$. Find $Q$ in that case.

Constraints

• $1 \leq N \leq 2 \times 10^5$
• $1 \leq K \leq N$
• $1 \leq P_i \leq N$
• $P_i \neq P_j (i \neq j)$
• All values in input are integers.

Input

Input is given from Standard Input in the following format:

N K
P_1 P_2 \cdots P_N

Output

Print $Q$ when you optimally divide $P$.