#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>

int n, m, b, q;
const int M = 11451419198;
void slv(){
    cin >> n >> m >> q;
    int b = sqrt(m) + 1;

    vector<int> l(m + 2), r(m + 2);

    int cnt = 0;
    for(int i = 1; i <= m; ++i) {
        l[i] = (i - 1) * b + 1, r[i] = i * b;
        if(r[i] >= m) {
            r[i] = m;
            cnt = i;
            break;
        } 
    }

    vector<vector<int> >g(n + 1, vector<int>(cnt + 1));
    for(int i = 1; i <= n; ++i){
        for(int j = 1; j <= cnt; ++j){
            g[i][j] = i;
        }
    }

    int op, x, y;
    unordered_map<int, int> v1, v2;
    //v1代表有↓，v2代表有↑
    while(q--){
        cin >> op;
        if(op == 2){
            cin >> x;
            for(int j = 1; j <= cnt; ++j){
                x = g[x][j];
            }
            cout << x << '\n';
        } else {
            cin >> x >> y;
            v1[x * M + y] = 1;
            v2[(x + 1) * M + y] = 1;
            int now_b = (y - 1) / b + 1, x1, x2;//影响哪个块
            //x, y

            x1 = x;
            for(int j = y - 1; j >= l[now_b]; --j){
                if(v2[x1 * M + j]) x1--;
                else if(v1[x1 * M + j]) x1++;
            }
            
            //x + 1, y
            x2 = x + 1;
            for(int j = y - 1; j >= l[now_b]; --j){
                if(v2[x2 * M + j]) x2--;
                else if(v1[x2 * M + j]) x2++;
            }
            swap(g[x1][now_b], g[x2][now_b]);
        }
    }
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int _ = 1; // cin >> T;
    while (_--) slv();
    return 0;
}
/*
3 4 13
2 2
1 1 3
2 1
2 2
2 3
1 2 4
2 1
2 2
2 3
1 2 1
2 1
2 2
2 3
*/