Lexicographically Smallest

Problem Description

Choose $N$ distinct numbers in order from a sequence of $M$ numbers, so that the $N$ numbers form the lexicographically smallest sequence.

Input Format

The first line contains two integers $M, N$ — the length of the sequence and the number of numbers to choose in order ($1 < N \le M \le 10^6$).

The next $M$ lines: the $i$-th line contains $a_i$, the $i$-th number of sequence $M$, where $1 \le a_i \le N$. It is guaranteed that every number in $[1, N]$ appears at least once.

Output Format

Output $N$ numbers separated by spaces, representing the lexicographically smallest sequence (no trailing space after the last number).

Sample Input

6 3
3
2
1
3
1
3

Sample Output

2 1 3

Hint

The lexicographically smallest sequence you are looking for need not be contiguous in sequence $M$.