Problem:
Priority Queue

Priority queue is a container of elements which the element with the highest priority should be extracted first.

For $n$ priority queues $Q_i$ ($i = 0, 1, ..., n-1$) of integers, perform a sequence of the following operations.

insert($t$, $x$): Insert $x$ to $Q_t$.

getMax($t$): Report the maximum value in $Q_t$. If $Q_t$ is empty, do nothing.

deleteMax($t$): Delete the maximum element from $Q_t$. If $Q_t$ is empty, do nothing.

In the initial state, all queues are empty.

Input

The input is given in the following format.

$n \; q$
$query_1$
$query_2$
:
$query_q$

Each query $query_i$ is given by

0 $t$ $x$

or

1 $t$

or

2 $t$

where the first digits 0, 1 and 2 represent insert, getMax and deleteMax operations respectively.

Output

For each getMax operation, print an integer in a line.

Constraints

$1 \leq n \leq 1,000$

$1 \leq q \leq 200,000$

$-1,000,000,000 \leq x \leq 1,000,000,000$

Sample Input 1

2 10
0 0 3
0 0 9
0 0 1
1 0
2 0
1 0
0 0 4
1 0
0 1 8
1 1

Sample Output 1

9
3
4
8

Solution in Python3 (judge verdict: Accepted)

import bisect



n, q = map(int, input().split())

Q = [[] for _ in range(n)]


for _ in range(q):

    command, *list_num = input().split()

    t = int(list_num[0])

    if   command == "0":
        # insert(t, x)
        x = int(list_num[1])
        bisect.insort(Q[t], x)
    elif command == "1":
        # getMax(t)
        if Q[t]:
            print(Q[t][-1])
    elif command == "2":
        # deleteMax(t)
        if Q[t]:
            del Q[t][-1]
    else:
        raise