#include<bits/stdc++.h>
#define LL long long
using namespace std;
int n,m,q;
struct node{
    int a,b,id;
}a[1010];
bool cmp(node a,node b){
    return a.a>b.a;
}
int rr[1010],vis[1010];
set <int> s;
signed main(){
    scanf("%d%d%d",&n,&m,&q);
    for(int i=1;i<=n;++i)   scanf("%d%d",&a[i].a,&a[i].b),a[i].id=i;
    sort(a+1,a+n+1,cmp);
    for(int i=1;i<=n;++i)   rr[a[i].id]=i;
    while(q--){
        int op,x;
        scanf("%d%d",&op,&x);
        if(op==1)           scanf("%d",&a[rr[x]].b);
        else{
            for(int i=1;i<=n;++i)   vis[i]=0;
            for(int i=1;i<=n;++i){
                if(a[i].b==1){
                    vis[i]=1;
                    break;
                }
            }
            for(int i=1,cnt=2;i<=n&&cnt<=m;++i){
                if(vis[i])  continue;
                vis[i]=1;
                ++cnt;
            }
            if(vis[rr[x]]==1)   puts("1");
            else puts("0");
        }
    }
}