#include <bits/stdc++.h>
#define VMAX 12
#define INF 2000000000
using namespace std;
ifstream fin ("mergeheap.in");
ofstream fout ("mergeheap.out");

multiset<int> mp[VMAX];
vector<int> numere[VMAX];

int main()
{
    int n,m,i,j,k,t,q,nr,minim,maxim,suma;
    fin>>n>>t;
    for(i=0;i<=n;i++)
        numere[i].push_back(0);
    for(q=1;q<=t;q++)
    {
        fin>>i>>j;
        if(i==1)
        {
            fin>>k;
            mp[j].insert(k);
        }
        else if(i==2)
        {
            auto it = mp[j].end();
            it--;
            fout<<*it<<'\n';
            mp[j].erase(it);
        }
        else
        {
            fin>>k;
            merge(mp[j].begin(),mp[j].end(),mp[k].begin(),mp[k].end(),inserter(mp[j],mp[j].begin()));
            mp[k].clear();
        }
    }


    return 0;
}