Early Orders

아직 제출이 없습니다시간 제한4초메모리 제한1024 MB

문제 설명

예제2

문제

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.