#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
using ll=long long;
using ull=unsigned long long;
#define pi pair<int, int>
#ifdef LOCAL
#include"D:/Administrator/Documents/vscode/algo/debug.h"
#else
#define debug(...) 42
#endif

//const int N = 2e5 //Lance老师注意改一下数据范围
const int INF = 2e9 + 1000;
const ll INFLL = 8e18 + 1000;
mt19937 mrand(random_device{}());
//模板区域~~~~~~~

//模板结束~~~~~~~

void solve(){
    ll n,m,q,MAX=0;
    cin>>n>>m>>q;
    vector<pair<pair<ll,int>,ll>> a(n+1);
    vector<pair<ll,ll>> b(n+1);
    for(int i=1;i<=n;i++){
        cin>>a[i].first.first>>a[i].first.second;
        a[i].second=i;
    }
    sort(a.begin(),a.end());
    for(int i=1;i<=n;i++){
        b[a[i].second].first=i;
        b[a[i].second].second=a[i].first.second;
        if(b[a[i].second].first>b[MAX].first&&b[a[i].second].second==1){
            MAX=a[i].second;
        }
    }
    while(q--){
        int op,x,y;
        cin>>op;
        if(op==2){
            cin>>x;
            //cout<<MAX<<' ';
            if(b[MAX].first>n-m){
                if(b[x].first>n-m){
                    cout<<1<<endl;
                }else{
                    cout<<0<<endl;
                }
            }else{
                if(b[MAX].first>n-m+1||x==MAX){
                    cout<<1<<endl;
                }else{
                    cout<<0<<endl;
                }
            }
        }else{
            cin>>x>>y;
            b[x].second=y;
            MAX=0;
            for(int i=1;i<=n;i++){
                if(b[i].first>b[MAX].first&&b[i].second==1){
                    MAX=i;
                }
            }
        }
    }
}
signed main(){
#ifndef LOCAL
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#endif
#ifdef LOCAL
    freopen("D:/Administrator/Documents/vscode/in.txt","r",stdin);
    freopen("D:/Administrator/Documents/vscode/out.txt","w",stdout);
#endif
    int T = 1;
    //cin >> T;
    while(T--) solve();
}