#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=2e6+10;
ll n,m,q;
struct hy{
    ll x,id,sex;
}a[N];
bool cmp(hy x,hy y){
    return x.x>y.x;
}
void solve(){
    cin>>n>>m>>q;
    bool f4=0;
    for(int i=1;i<=n;i++){
        cin>>a[i].x;
        cin>>a[i].sex;
        a[i].id=i;
        if(a[i].sex==1) f4=1;
    }
    sort(a+1,a+n+1,cmp);
    while(q--){
        ll op;
        cin>>op;
        if(op==1){
            ll id,x;
            cin>>id>>x;
            for(int i=1;i<=n;i++){
                if(a[i].id==id) {a[i].sex=x;break;}
            }
        }else{
            ll x;
            cin>>x;
            bool f1=0,f2=0,f=0;
            f4=0;
            for(int i=1;i<=n;i++){
                if(a[i].sex==1) {f4=1;break;}
            }
            for(int i=1;i<=m;i++){
                if(a[i].sex==1) f=1;
                if(a[i].id==x&&i<=m-1) f1=1;
                if(a[i].id==x) f2=1;
            }
            if(f4&&!f){
                for(int i=1;i<=n;i++){
                    if(a[i].sex==1){
                        if(a[i].id==x) f1=1;
                        break;
                    }
                }
                if(f1) cout<<1<<endl;
                else cout<<0<<endl;
            }else {
                if(f2) cout<<1<<endl;
                else cout<<0<<endl;
            }

        }

    }

}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    //cin>>t;
    while(t--){
        solve();
    }
    return 0;
}