#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()

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;
    }
    set<int> ys;
    while (q--) {
        int t; cin >> t;
        if (t == 1) {
            int ind; cin >> ind; ind--;
            auto it = ys.lower_bound(a[ind].second);
            if (it != ys.end()) {
                cout << max(n - *it, a[ind].first) << ' ' << a[ind].second << '\n';
            } else {
                cout << a[ind].first << ' ' << a[ind].second << '\n';
            }
        } else if (t == 2) {
            int hg; cin >> hg;
            ys.insert(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++;
        }
    }
}

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