#include <bits/stdc++.h>
using namespace std;

typedef long long LL;

struct Block{

    static const int N = 1e5 + 50;

    int len, n, m, num;
    int belg[320 * N], nxt[320 * N], ed[N];
    map<LL, int> id;

    void init(int _n, int _m){
        n = _n;
        m = _m;
        len = sqrt(_m);
        num = m / len;
        int num = _m / len;
        for(int i = 1; i <= n; i++){
            ed[i] = i;
            for(int j = 1; j <= num; j++) belg[(i - 1) * num + j] = i;
            for(int j = 1; j <  num; j++) nxt[(i - 1) * num + j] = (i - 1) * num + j + 1;
        }
        return;
    }

    void update(int nx, int x){
        int ny = nx + 1, y = x;
        LL xx = 1LL * (nx - 1) * m + x, yy = 1LL * (ny - 1) * m + y;
        int idx = (nx - 1) * num + x / len + (x % len ? 1 : 0), idy = (ny - 1) * num + y / len + (y % len ? 1 : 0);
        if(id.find(xx) != id.end()) idx = id[xx];
        if(id.find(yy) != id.end()) idy = id[yy];

        int bex = belg[idx], bey = belg[idy];
        swap(ed[bex], ed[bey]);

        for(LL i = xx; i <= min(1LL * (nx - 1) * m + (x / len + (x % len ? 1 : 0)) * len, 1LL * nx * m); i++) id[i] = idy;
        for(LL i = yy; i <= min(1LL * (ny - 1) * m + (y / len + (y % len ? 1 : 0)) * len, 1LL * ny * m); i++) id[i] = idx;

        for(int i = nxt[idx]; i; i = nxt[i]) belg[i] = bey;
        for(int i = nxt[idy]; i; i = nxt[i]) belg[i] = bex;

        swap(nxt[idx], nxt[idy]);
        return;
    }

    int query(int x){
        return ed[x];
    }

}B;

void solve(){
    int n, m, q;
    cin >> n >> m >> q;
    B.init(n, m);  
    for(int i = 1; i <= q; i++){
        int opt, a, b;
        cin >> opt >> a;
        if(opt == 1){
            cin >> b;
            B.update(a, b);
        }else{
            cout << B.query(a) << "\n";
        }
    }
    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    while(T--){
        solve();
    }
    return 0;
}