#include <bits/stdc++.h>
#include <cassert>

using namespace std;

#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()

struct segtree {
    int n; 
    vector<int> t;
    segtree() = default;
    segtree(int n_) {
        n = n_;
        t.assign(4 * n, 1e9 + 1);
    }
    void upd(int v, int tl, int tr, int l, int r, int x) {
        if (l <= tl && tr <= r) {
            t[v] = min(t[v], x);
            return;
        }
        if (tr <= l || tl >= r) return;
        int tm = (tl + tr) / 2;
        upd(v * 2, tl, tm, l, r, x); upd(v * 2 + 1, tm, tr, l, r, x);
    }
    void free(int id) {
        int v = 1, tl = 0, tr = n;
        while (tl + 1 < tr) {
            int tm = (tl + tr) / 2;
            if (id < tm) {
                v *= 2; tr = tm;
            } else {
                v = v * 2 + 1;
                tl = tm;
            }
        }
        t[v] = 1e9 + 1;
        int prv = v;
        v >>= 1;
        while (v) {
            if (prv & 1) {
                t[v * 2] = max(t[v * 2], t[v]);
            } else {
                t[v * 2 + 1] = max(t[v * 2 + 1], t[v]);
            }
            t[v] = 1e9 + 1;
            prv = v; 
            v >>= 1;
        }
    }
    int get(int id) {
        int v = 1, tl = 0, tr = n;
        int ans = t[v];
        while (tl + 1 < tr) {
            int tm = (tl + tr) / 2;
            if (id < tm) {
                v *= 2; tr = tm;
            } else {
                v = v * 2 + 1;
                tl = tm;
            }
            ans = min(ans, t[v]);
        }
        return ans;
    }
};

void solve() {
    int n, m, q; cin >> n >> m >> q;
    vector<pair<int, int>> a(m);
    for (int i = 0; i < m; i++) cin >> a[i].first >> a[i].second;
    vector<int> l(m), r(m);
    for (int i = 0; i < m; i++) {
        l[i] = a[i].first; r[i] = n - a[i].second;
    }
    vector<pair<int, int>> queries(q);
    for (int i = 0; i < q; i++) {
        int t; cin >> t;
        if (t == 1) {
            int ind; cin >> ind; ind--;
            queries[i] = {0, ind};
        } else if (t == 2) {
            int hg; cin >> hg;
            queries[i] = {1, hg};
        } else if (t == 3) {
            int wg; cin >> wg; continue;
        } else {
            int x, y; cin >> x >> y;
            a.pb({x, y});
            l.pb(x); r.pb(n - y);
            m++;
            queries[i] = {2, m - 1};
        }
    }

    vector<int> ord(m, 0);
    iota(all(ord), 0);
    sort(all(ord), [&](int i, int j) {
        return a[i].second < a[j].second;
    });
    vector<int> pos(m);
    for (int i = 0; i < m; i++) pos[ord[i]] = i;
    segtree sg(m);

    for (int i = 0; i < q; i++) {
        if (queries[i].first == 0) {
            int lol = sg.get(pos[queries[i].second]);
            //cout << lol << '\n';
            cout << max(n - lol, a[queries[i].second].first) << ' ' << a[queries[i].second].second << '\n';
        } else if (queries[i].first == 1) {
            int L = -1, R = sz(ord);
            while (R - L > 1) {
                int M = (L + R) / 2;
                if (a[ord[M]].second <= queries[i].second) L = M;
                else R = M;
            }
            if (R) sg.upd(1, 0, m, 0, R, queries[i].second);
        } else {
            sg.free(pos[queries[i].second]);
        }
    }
}

signed main() {
    int tt = 1;
    #ifdef LOCAL 
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        cin >> tt;
    #else 
        cin.tie(0)->sync_with_stdio(false);
    #endif

    while (tt--) {
        solve();
    }
    return 0;
}