#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, tim = 0;
    vector<pair<int, int>> t;
    segtree() = default;
    segtree(int n_) {
        n = n_;
        t.resize(4 * n, {-1, -1});
    }

    void upd(int l, int r, int x) {
        tim++;
        upddud(1, 0, n, l, r, x);
    }

    void upddud(int v, int tl, int tr, int l, int r, int x) {
        if (l <= tl && tr <= r) {
            t[v] = {x, tim};
            return;
        }
        if (tr <= l || tl >= r) return;
        int tm = (tl + tr) / 2;
        upddud(v * 2, tl, tm, l, r, x);
        upddud(v * 2 + 1, tm, tr, l, r, x);
    }

    int get(int p) {
        int v = 1, tl = 0, tr = n;
        pair<int, int> cur = t[v];
        while (tl + 1 < tr) {
            int tm = (tl + tr) /2;
            if (p < tm) {
                v *= 2; tr = tm;
            } else {
                v = v * 2 + 1;
                tl = tm;
            }
            if (t[v].second < cur.second) cur = t[v];
        }
        return cur.first;
    }
};

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;
    }
    segtree sgl(n), sgr(n);
    for (int i = 0; i < n; i++) {
        sgl.upd(i, i + 1, l[i]);
        sgr.upd(i, i + 1, r[i]);
    }
    while (q--) {
        int t; cin >> t;
        if (t == 1) {
            int ind; cin >> ind; ind--;
            cout << sgl.get(ind) << ' ' << n - sgr.get(ind) << '\n';
        } else if (t == 2) {
            int hg; cin >> hg;
            int curpt = n - hg;
            int L = -1, R = m;
            while (R - L > 1) {
                int M = (L + R) / 2;
                if (sgl.get(M) <= curpt) L = M;
                else R = M;
            }
            int rg = L;
            L = -1; R = m;
            while (R - L > 1) {
                int M = (L + R) / 2;
                if (sgr.get(M) >= curpt) R = M;
                else L = M;
            }
            if (R <= rg) {
                sgl.upd(R, rg, curpt);
            }
            // for (int i = 0; i < m; i++) {
            //     if (l[i] <= curpt && curpt <= r[i]) l[i] = curpt;
            // }
        } else if (t == 3) {
            int wg; cin >> wg;
            int curpt = wg;
            int L = -1, R = m;
            while (R - L > 1) {
                int M = (L + R) / 2;
                if (sgl.get(M) <= curpt) L = M;
                else R = M;
            }
            int rg = L;
            L = -1; R = m;
            while (R - L > 1) {
                int M = (L + R) / 2;
                if (sgr.get(M) >= curpt) R = M;
                else L = M;
            }
            if (R <= rg) {
                sgr.upd(R, rg, curpt);
            }
        } else {
            int x, y; cin >> x >> y;
            a.pb({x, y});
            l.pb(x); r.pb(n - y);
            m++;
        }
    }
}

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;
}