#include<bits/stdc++.h>

using namespace std;

#define irep(i,l,r) for(int i = l; i <= r; ++ i)

const int N = 100099;
const int len = 420;

int per[N][400],invp[N][400],  id[N];
vector<array<int, 2>>p[400];
// clo, line
int main(){
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int n, m, q;
	cin >> n >> m >> q;
	memset(per, 1, sizeof(per));
	for(int i = 1; i <= m; ++ i){
		id[i] = i / len;
	}
	
	for(int c = 0; c <= m / len; c ++){
		for(int i = 1; i <= n; ++ i){
			per[i][c] = invp[i][c] = i;
		}
	}
	while(q --){
		int op;
		cin >> op;
		if(op == 1){
			int line, cloumn;
			cin >> line >> cloumn;
			int x = id[cloumn];
			array<int, 2> PI = {cloumn, line};
			vector<array<int, 2>>temp;
			
			while(p[x].size()){
				auto [c, l] = p[x].back();
				if(c < cloumn)break;
				temp.push_back(p[x].back());
				per[invp[l][x]][x] = l + 1;
				per[invp[l + 1][x]][x] = l;
				swap(invp[l][x], invp[l + 1][x]);
				/*
				A -> per[A][x]
				
				*/
				p[x].pop_back();
			}
			temp.push_back(PI);
			
			while(temp.size()){
				auto [c, l] = temp.back();
	//			swap(per[l][x], per[l + 1][x]);
				per[invp[l][x]][x] = l + 1;
				per[invp[l + 1][x]][x] = l;
				swap(invp[l][x], invp[l + 1][x]);
				p[x].push_back(temp.back());
				temp.pop_back();
			}
		//	irep(i, 1, n){
		//		cerr << per[i][0] << ' ';
		//	}
		//	cerr << endl;
		}
		else{
			int a;
			cin >> a;
			for(int x = 0; x <= m / len; ++ x){
				a = per[a][x];
			}
			cout << a << endl;
		}
	}
}