#include <iostream>
#include <fstream>
#include <cstdlib>
#include <ctime>
#include <vector>
using namespace std;

ifstream fin("mergeheap.in");
ofstream fout("mergeheap.out");

struct TreapNode {
    int key, priority;
    TreapNode *left, *right;
};

TreapNode* rightRotate(TreapNode* y) {
    TreapNode *x = y->left;
    TreapNode *T2 = x->right;
    x->right = y;
    y->left = T2;
    return x;
}

TreapNode* leftRotate(TreapNode* x) {
    TreapNode *y = x->right;
    TreapNode *T2 = y->left;
    y->left = x;
    x->right = T2;
    return y;
}

TreapNode* newNode(int key) {
    TreapNode* temp = new TreapNode;
    temp->key = key;
    temp->priority = rand();
    temp->left = temp->right = NULL;
    return temp;
}

TreapNode* search(TreapNode* root, int key) {
    if (!root || root->key == key) return root;
    if (key < root->key) return search(root->left, key);
    return search(root->right, key);
}

TreapNode* insert(TreapNode* root, int key) {
    if (!root) return newNode(key);
    if (key < root->key) {
        root->left = insert(root->left, key);
        if (root->left->priority > root->priority)
            root = rightRotate(root);
    } else {
        root->right = insert(root->right, key);
        if (root->right->priority > root->priority)
            root = leftRotate(root);
    }
    return root;
}

TreapNode* deleteNode(TreapNode* root, int key) {
    if (!root) return root;
    if (key < root->key)
        root->left = deleteNode(root->left, key);
    else if (key > root->key)
        root->right = deleteNode(root->right, key);
    else {
        if (!root->left) {
            TreapNode* temp = root->right;
            delete root;
            return temp;
        } else if (!root->right) {
            TreapNode* temp = root->left;
            delete root;
            return temp;
        }
        if (root->left->priority < root->right->priority) {
            root = leftRotate(root);
            root->left = deleteNode(root->left, key);
        } else {
            root = rightRotate(root);
            root->right = deleteNode(root->right, key);
        }
    }
    return root;
}

int findMaxLE(TreapNode* root, int x) {
    int res = -1e9 - 5;
    while (root) {
        if (root->key <= x) {
            res = root->key;
            root = root->right;
        } else {
            root = root->left;
        }
    }
    return res;
}

int findMinGE(TreapNode* root, int x) {
    int res = 1e9 + 5;
    while (root) {
        if (root->key >= x) {
            res = root->key;
            root = root->left;
        } else {
            root = root->right;
        }
    }
    return res;
}

void rangeQuery(TreapNode* root, int x, int y, vector<int>& result) {
    if (!root) return;
    if (x < root->key)
        rangeQuery(root->left, x, y, result);
    if (x <= root->key && root->key <= y)
        result.push_back(root->key);
    if (y > root->key)
        rangeQuery(root->right, x, y, result);
}

// 🔁 Funcție nouă: reunire a două Treap-uri
TreapNode* mergeTreap(TreapNode* a, TreapNode* b) {
    if (!a || !b) return a ? a : b;
    if (a->priority > b->priority) {
        a->right = mergeTreap(a->right, b);
        return a;
    } else {
        b->left = mergeTreap(a, b->left);
        return b;
    }
}

// 🔧 Cod principal pentru problema mergeheap
int main() {
    srand(time(NULL));
    int N, Q;
    fin >> N >> Q;
    vector<TreapNode*> heaps(N + 1, nullptr);

    for (int i = 0; i < Q; ++i) {
        int op, a, b;
        fin >> op;
        if (op == 1) {
            fin >> a >> b; // inserare
            heaps[a] = insert(heaps[a], b);
        } else if (op == 2) {
            fin >> a; // extragere maxim
            TreapNode* cur = heaps[a];
            while (cur->right) cur = cur->right;
            fout << cur->key << '\n';
            heaps[a] = deleteNode(heaps[a], cur->key);
        } else if (op == 3) {
            fin >> a >> b; // reunire
            if (a == b) continue;
            heaps[a] = mergeTreap(heaps[a], heaps[b]);
            heaps[b] = nullptr;
        }
    }

    return 0;
}