21186번 - Early Orders 다국어

문제

You are given a list of integers $x_1, x_2, \ldots, x_n$ and a number $k$. It is guaranteed that each $i$ from 1ドル$ to $k$ appears in the list at least once.

Find the lexicographically smallest subsequence of $x$ that contains each integer from 1ドル$ to $k$ exactly once.

입력

The first line will contain two integers $n$ and $k,ドル with 1ドル\le k\le n\le 200,000円$. The following $n$ lines will each contain an integer $x_i$ with 1ドル\le x_i\le k$.

출력

Write out on one line, separated by spaces, the lexicographically smallest subsequence of $x$ that has each integer from 1ドル$ to $k$ exactly once.

제한

힌트