Ordered Set

Initially, integers $A_1,A_2,\cdots,A_N$ are given. Let $S$ be the set containing these integers. If the same value appears more than once, it is stored only once in the set.

Process $Q$ operations in order. Each operation is one of the following three types.

• $1\ x$: Insert $x$ into $S$. If $x$ is already in $S$, nothing happens.
• $2\ x$: Erase from . If is not in , nothing happens.

For every type-$3$ operation, the $k$-th smallest element is guaranteed to exist.

The input is given in the following format.

$N\ Q$ $A_1\ A_2\ \cdots\ A_N$

For each type-$3$ operation, print the $k$-th smallest element of $S$ on its own line.

• $1 \leq N,Q \leq 300\,000$.
• $N+Q \leq 500\,000$.
• ().