K-th maximum — Eolymp

Input

The first line contains the number of commands $n$ ( $n \leq 1 0^{5}$ n \leq 10^5). Each of the next $n$ lines contains a single command. Each command is given in the form of two numbers $c_{i}$ c_i and $k_{i}$ k_i — the type and argument of the command, respectively ( $∣ k_{i} ∣ \leq 1 0^{9}$ |k_i| \leq 10^9). The supported commands are:

$+ 1$ : Add an element with key $k_{i}$ k_i.
$0$ : Find and output the $k_{i}$ k_i-th maximum.
$- 1$ : Remove the element with key $k_{i}$ k_i.

It is guaranteed that during processing, it is never required to store elements with equal keys in the structure or remove non-existent elements. It is also guaranteed that, for every query for the $k_{i}$ k_i-th maximum, it exists.

Output

For each command of type zero, output a single line containing the $k_{i}$ k_i-th maximum.

Examples

Example 1

Loading