#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
const int len=355;
int n,m,q;
struct operation{
	int op,a,b,id,pos;
}a[maxn],b[maxn];

bool cmp(operation a,operation b){
	return a.b<b.b;
}
using pii = pair<int,int>;
struct Block{
	vector <int> vec;
	set <pii> S;
	unordered_map <int, int> trans, idx;
	void insert(int p, int t){ // swap(p, p + 1) at time t
		S.insert(make_pair(t, p));
		for (auto item : S){
			int p = item.second;
			trans[p] = p;
			trans[p + 1] = p + 1;
		}
		for (auto item : S){
			int p = item.second;
			swap(trans[p], trans[p + 1]);
		}
		for (auto item : trans)
			idx[item.second] = item.first;
	}
	int transfer(int x){
		if (idx.find(x) == idx.end())
			return x;
		return idx[x];
	}
}bk[405];

int tmp[maxn];
signed main(){
//	freopen("A.in","r",stdin);
//	freopen("A.out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin>>n>>m>>q;
	int cnt=0;
	for(int i=0;i<q;i++){
		cin>>a[i].op;
		a[i].id=i;
		if(a[i].op==1){
			cin>>a[i].a>>a[i].b;
			b[cnt]=a[i];
			cnt++;
		}
		else{
			cin>>a[i].a;
		}
	}
	sort(b,b+cnt,cmp);
	cnt--;
	int len=sqrt(cnt);
	int mx=0;
	for(int i=0;i<=cnt;i++){
		int id=b[i].id;
		a[id].pos=cnt/len;
		mx=max(mx,cnt/len);
	}
	
	for(int i=0;i<q;i++){
		if(a[i].op==1){
//			printf("insert: %d %d\n",a[i].a,a[i].b);
			int pos=a[i].pos;
			bk[pos].insert(a[i].a,a[i].b);
			
		}
		else{
			int x=a[i].a;
			for(int i=0;i<=mx;i++){
				x=bk[i].transfer(x);
			}
			printf("%d\n",x);
		}
	}
	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

*/