Problem: 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.

Constraints

* $1 \leq n \leq 1,000$
* $1 \leq q \leq 200,000$
* $-1,000,000,000 \leq x \leq 1,000,000,000$

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.

Example

Input

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


Output

9
3
4
8

Solution (in CPP):

Solution:
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<stdio.h>
#include<map>
#include<vector>
#include<queue>
using namespace std;
map<long long, priority_queue<int > >a;
//priority_queue<int > a[1005];
int main()
{
    int n, q;
    int x, z;
    long long y;
    cin >> n >> q;
    
        for (int i = 0; i < q; i++)
        {
            cin >> x >> y;
            switch (x)
            {
            case(0):
                scanf("%d", &z);
                a[y].push(z);
                break;
            case(1):
                if (!a[y].empty())
                {
               printf("%d\n", a[y].top());
                }
                break;
            case(2):
                if (!a[y].empty())
                {
                a[y].pop();
                }

                break;
            default:
                break;
            }
        }
    


    return 0;
}