Lena and Queries

Description:

Input:

The first line of input contains integer n (1 ≤ n ≤ 3·10⁵) — the number of queries.

Each of the next n lines starts with integer t (1 ≤ t ≤ 3) — the type of the query.

A pair of integers a and b ( - 10⁹ ≤ a, b ≤ 10⁹) follows in the query of the first type.

An integer i (1 ≤ i ≤ n) follows in the query of the second type. It is guaranteed that i is less than the number of the query, the query number i has the first type and the pair from the i-th query is not already removed.

An integer q ( - 10⁹ ≤ q ≤ 10⁹) follows in the query of the third type.

Output:

For the queries of the third type print on a separate line the desired maximal value of x·q + y.

If there are no pairs in the set print "EMPTY SET".

Sample Input:

7
3 1
1 2 3
3 1
1 -1 100
3 1
2 4
3 1

Sample Output:

EMPTY SET
5
99
5