#include<iostream>
#include<queue>
using namespace std;
priority_queue<int> q[100000];
int MIN_VAL = 1000000000;
int main()
{
	int k, n;
	scanf("%d %d", &k, &n);
	int number;
	int index = -1;
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &number);
		if (number == 1)
		{
			int a, b;
			scanf("%d %d", &a, &b);
			q[a - 1].push(-b);
		}
		else if (number == 0)
		{
			for (int j = 0; j < k; j++)
			{
				if (!q[j].empty() && MIN_VAL>-q[j].top())
				{
					MIN_VAL = -q[j].top();
					index = j;
				}
			}

			q[index].pop();
			printf("%d\n", MIN_VAL);
			MIN_VAL = 1000000000;
			index = -1;
		}
	}

	return 0;
}