/*
The 2022 ICPC Asia Xi’an Regional Contest
Problem A. Bridge
*/
#include <bits/stdc++.h>
using namespace std;
constexpr int N = (int)1e5 + 5;
int qt[N], x[N], y[N], Y[N], S[N], a[N], J[N], L[640], R[640], id[N], cnt, f[640][N];

int main() {
    cin.tie(0)->ios::sync_with_stdio(false);
    int n, m, q;
    cin >> n >> m >> q;
    for (int i = 0; i < q; i++) {
        cin >> qt[i];
        if (qt[i] == 1) cin >> x[i] >> y[i];
        else cin >> x[i];
    }

    for (int i = 0; i < q; i++) if (qt[i] == 1) Y[y[i]]++;
    for (int i = 1; i <= m; i++) S[i] = S[i - 1] + Y[i];

    int bn = sqrt(m + 1) + 10;
    if(m > 4e5) bn = 10 *  sqrt(m + 1);
    for (int l = 1, r = 1, tot = 0; l <= m; l = r, tot = 0) {
        while (r <= m and tot < bn) tot += Y[r++];
        if (Y[r - 1] >= bn and l + 1 != r) {
            L[cnt] = l; R[cnt] = r - 2; cnt++;
            L[cnt] = r - 1; R[cnt] = r - 1; cnt++;
        }
        else {
            L[cnt] = l; R[cnt] = r - 1; cnt++;
        }
    }

    for (int i = 0; i < cnt; i++)
        for (int j = 1; j <= n; j++) f[i][j] = j;
    for (int i = 0; i <= cnt; i++)
        for (int j = L[i]; j <= R[i]; j++) id[j] = i;
    for (int i = 1; i <= m; i++) J[i] = S[i - 1];

    for (int t = 0; t < q; t++) {
        if (qt[t] == 1) {
            int k = id[y[t]];
            if (L[k] == R[k]) swap(f[k][x[t]], f[k][x[t] + 1]);
            else {
                a[J[y[t]]++] = x[t];
                for (int i = 1; i <= m; i++) f[k][i] = i;
                for (int i = R[k]; i >= L[k]; i--)
                    for (int j = S[i - 1]; j < J[i]; j++)
                        swap(f[k][a[j]], f[k][a[j] + 1]);
            }
        }
        else {
            int answer = x[t];
            for (int i = 0; i < cnt; i++) answer = f[i][answer];
            cout << answer << '\n';
        }
    }
    return 0;
}