using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using SB = System.Text.StringBuilder;
//using System.Threading.Tasks;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
using System.Numerics;
using static System.Math;
using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    readonly int dom = 998244353;
    bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; }

    void solve()
    {
        int N = cin.nextint;
        int Q = cin.nextint;
        var P = new SkewHeap<int>[N];
        for (int i = 0; i < P.Length; i++)
        {
            P[i] = new SkewHeap<int>();
        }

        for (int t = 0; t < Q; t++)
        {
            int mode = cin.nextint;
            if (mode == 0)
            {
                P[cin.nextint].Enqueue(cin.nextint);
            }
            else if (mode == 1)
            {
                int x = cin.nextint;
                if (P[x].Count == 0) continue;
                WriteLine(P[x].Peek);
            }
            else
            {
                int x = cin.nextint;
                if (P[x].Count == 0) continue;
                P[x].Dequeue();
            }
        }
    }
}

class SkewHeap<T> where T : IComparable<T>
{
    Node root;
    readonly Node nil;
    public SkewHeap()
    {
        nil = new Node(default(T));
        root = nil;
    }
    public void Meld(SkewHeap<T> h)
    {
        root = Meld(root, h.root);
    }
    Node Meld(Node a, Node b)
    {
        if (a.Count == 0) return b;
        if (b.Count == 0) return a;
        if (a.Key.CompareTo(b.Key) < 0) swap(ref a, ref b);
        a.right = Meld(a.right, b);
        swap(ref a.left, ref a.right);
        a.Update();
        return a;
    }
    public void Enqueue(T key)
    {
        Node node = new Node(key);
        node.left = nil;
        node.right = nil;
        node.Update();
        root = Meld(root, node);
    }
    public T Dequeue()
    {
        T ret = Peek;
        root = Meld(root.left, root.right);
        return ret;
    }
    public T Peek => root.Key;
    public int Count => root.Count;

    class Node
    {
        public T Key;
        public Node(T Key) { this.Key = Key; }
        public int Count{ get; private set; }
        public void Update() { Count = 1 + left.Count + right.Count; } 
        public Node left, right;
    }
    void swap<U>(ref U a, ref U b)
    {
        var t = a;
        a = b;
        b = t;
    }
}

static class Ex
{
    public static void join<T>(this IEnumerable<T> values, string sep = " ") => WriteLine(string.Join(sep, values));
    public static string concat<T>(this IEnumerable<T> values) => string.Concat(values);
    public static string reverse(this string s) { var t = s.ToCharArray(); Array.Reverse(t); return t.concat(); }

    public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) < 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U>
{
    public T f; public U s;
    public Pair(T f, U s) { this.f = f; this.s = s; }
    public int CompareTo(Pair<T, U> a) => f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s);
    public override string ToString() => $"{f} {s}";
}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan => ReadLine().Split();
    public int[] scanint => Array.ConvertAll(scan, int.Parse);
    public long[] scanlong => Array.ConvertAll(scan, long.Parse);
    public double[] scandouble => Array.ConvertAll(scan, double.Parse);
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint => int.Parse(next);
    public long nextlong => long.Parse(next);
    public double nextdouble => double.Parse(next);
}



Measured memory_bytes: 29696