Description

Libra and Rahn are playing a game of number.

Rahn has a set of two-tuples $\{(a_i,b_i)\}$, where $a_i$ and $b_i$ are both non-negative integers. Initially, the set is empty.

Libra has $t$ operatons which has three types for Rahn's set:

1. Add a two-tuple $(a_i,b_i)$ to Rahn's set.
2. Remove a single two-tuple $(a_i,b_i)$ from Rahn's set. It is guaranteed that there is at least one $(a_i,b_i)$ in the set.
3. Given a integer $c$, find the maxinum value of $\min(a_i,b_i+c)$, where $(a_i,b_i)$ is an element in Rahn's set. It is guaranteed that there is at least one two-tuple in the set.

Format

Input

The first line contains an integer $t(0\le t\le 10^6)$ representing the number of operations. For the following $t$ lines, the first integer $op$ on each line represents the type of the current operation.

• If $op=1$, the next two integers are $a_i$ and $b_i$, representing Libra adds $(a_i,b_i)$ to Rahn's set.
• If $op=2$, the next two integers are $a_i$ and $b_i$, representing Libra removes $(a_i,b_i)$ from Rahn's set.
• If $op=3$, the next integer is $c$. You should output the maximum value of $\min(a_i,b_i+c)$ in the set.

It is guaranteed that all the values of $a,b,c$ are integers in range $[0,10^6]$.

Output

For each operation with $op = 3$, output a line with an integer representing the answer.

Samples

9
1 200000 20000
1 150000 40000
1 120000 50000
1 130000 30000
3 80000
3 100000
3 140000
2 150000 40000
3 100000

120000
140000
160000
130000