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: Wrong Answer)

class binaryTree:
    def __init__(self, root = None):
        self.value = root
        self.left = None
        self.right = None

    def insert_left(self, insert):
        if self.left is None:
            self.left = binaryTree(insert)

        else:
            t = binaryTree(insert)
            t.left = self.left
            self.left = t

    def insert_right(self, insert):
        if self.right is None:
            self.right = binaryTree(insert)

        else:
            t = binaryTree(insert)
            t.right = self.left
            self.right = t

    def put_root(self, obj):
        self.value = obj

def makeBntr(bnary, num):
    if bnary is None:
        return binaryTree(num)

    elif bnary.value is None:
        return binaryTree(num)

    elif bnary.value < num:
        bnary.left = makeBntr(bnary.left, num)

    else:
        bnary.right = makeBntr(bnary.right, num)

    return bnary

def maxLeaf(bnary):
    #print("maxLeaf>>", bnary.value, bnary.left, bnary.right)
    if bnary.value is None:
        return 0

    elif bnary.left is not None:
        return maxLeaf(bnary.left)

    else:
        #print(bnary)
        return bnary

def getLeaf(bnary):
    return maxLeaf(bnary).value

def mkBntr(bnary, num):
    #print("mkBntr>>", bnary.value, bnary.left, bnary.right, num)
    if bnary is None:
        return num

    elif bnary.value is None:
        return num

    elif bnary.value < num.value:
        bnary.left = makeBntr(bnary.left, num)

    else:
        bnary.right = makeBntr(bnary.right, num)

    return bnary

def toLeft(bnary):
    if bnary.left is None:
        right = bnary.right
        bnary = None
        return bnary, right
    else:
        bnary.left, right = toLeft(bnary.left) 
        return bnary, right

def delLeaf(bnary):
    bnary, right = toLeft(bnary)
    return bnary if right is None else mkBntr(bnary, right)



if __name__ == '__main__':
    n, q = input().split()
    n, q = int(n), int(q)
    ##print("n = %d, q = %d" %(n, q))
    S = [binaryTree() for i in range(n)]

    for i in range(q):
        query = input().split()
        bnary = S[int(query[1])]
        ##print('---', query[0], query[1])
        if query[0] == '0':
            S[int(query[1])] = makeBntr(bnary, int(query[2]))

        else:
            if bnary.value is None:
                pass
            elif query[0] == '1':
                print(getLeaf(bnary))
            else:
                #print("========")
                S[int(query[1])] = delLeaf(bnary)