#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
template <typename T> inline void read(T &F) {
    int R = 1; F = 0; char CH = getchar();
    for(; !isdigit(CH); CH = getchar()) if(CH == '-') R = -1;
    for(; isdigit(CH); CH = getchar()) F = F * 10 + CH - 48;
    F *= R;
}
inline void file(string str) {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
}
const int N = 1e5 + 10, B = 400;
int n, m, q, op[N], g[N], id[N], tot, flag[N], p[B][N], tmp[N], M; pair<int, int> c[N];
void rebuild(int x) {
    const int l = (x - 1) * B + 1, r = x * B;
    for(int i = 1; i <= n; i++) tmp[i] = i;
    for(int i = l; i <= r; i++)
        if(flag[i]) swap(tmp[g[c[i].second]], tmp[g[c[i].second] + 1]);
    for(int i = 1; i <= n; i++) p[x][tmp[i]] = i;
}
void ins(int x) {
    flag[x] = 1;
    const int y = (x - 1) / B + 1;
    rebuild(y);
}
int qry(int x) {
    for(int i = 1; i <= M; i++) x = p[i][x];
    return x;
}
int main() {
    //file("");
    read(n), read(m), read(q); 
    for(int i = 1; i <= q; i++) {
        read(op[i]);
        if(op[i] == 1) {
            int a, b; read(a), read(b);
            c[++tot] = make_pair(b, i);
            g[i] = a;
        }
        else read(g[i]);
    }
    sort(c + 1, c + tot + 1);
    for(int i = 1; i <= tot; i++) id[c[i].second] = i;
    M = (n - 1) / B + 1;
    for(int i = 1; i <= M; i++)
        for(int j = 1; j <= n; j++) p[i][j] = j;
    for(int i = 1; i <= q; i++) {
        if(op[i] == 1) ins(id[i]);
        else cout << qry(g[i]) << '\n';
    }
    #ifdef _MagicDuck
        fprintf(stderr, "# Time: %.3lf s", (double)clock() / CLOCKS_PER_SEC);
    #endif
    return 0;
}