#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pll pair<long long,long long>
#define fi first
#define se second
const int N=1e6+10;
const double eps=1e-5;

int n,m,k,q;
int res,cnt;

set<int> st[N];
map<int,bool> mp[N];

void dfs(int id,int pos,int dep)
{
    if(dep>1e5+10) return;
    auto it=upper_bound(st[id].begin(),st[id].end(),pos);
    if(it==st[id].end())
    {
        res=id;
        return;
    }

   // cout<<id<<" "<<pos<<" "<<f<<"------"<<*it<<endl;
    int ne;
    if(mp[id][*it]) ne=id+1;
    else ne=id-1;
    dfs(ne,*it,dep+1);
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>m>>q;
    while(q--)
    {
        int op,a,b;
        cin>>op;
        if(op==1)
        {
            cin>>a>>b;
            st[a].insert(b);
            st[a+1].insert(b);
            mp[a][b]=1;
            mp[a+1][b]=0;
        }
        else
        {
            cin>>a;
            res=a;
            dfs(a,-1,-1);
            cout<<res<<endl;
        }
    }
}
/*
3 3=3 3
2_
2__
__1
___
*/