#include<bits/stdc++.h>
using namespace std;

#define ONLINE
#ifndef ONLINE
#define debug(...) fprintf(stderr,##__VA_ARGS__)
#else
#define debug(...) ;
#endif

using LL=long long;
using PII=pair<int,int>;

#define N 1010
int a[N],b[N];//a:val b:gender

template<typename T>
inline T READ(){
	T x=0; bool f=0; char c=getchar();
	while(c<'0' || c>'9') f|=(c=='-'),c=getchar();
	while(c>='0' && c<='9') x=x*10+c-'0',c=getchar();
	return f?-x:x;
}
inline int read(){return READ<int>();}
inline LL readLL(){return READ<LL>();}
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

template<typename T>
class fhqTreap{
private:
	struct Node{
		int l,r,siz; LL rnd;
		T val,sum;
		Node(){
			l=r=siz=0; rnd=0ll;
			val=sum=T(0);
		}
		Node(int l_,int r_,int siz_,LL rnd_,T val_,T sum_){
			l=l_,r=r_,siz=siz_; rnd=rnd_;
			val=val_,sum=sum_;
		}
	};
	vector<Node>q;
	int root,rootX,rootY,rootZ;
	int New(T val){
		Node new_node=Node(0,0,1,rng(),val,val);
		q.push_back(new_node);
		return q.size()-1;
	}
	void Update(int id){
		q[id].siz=q[q[id].l].siz+q[q[id].r].siz+1;
		q[id].sum=q[q[id].l].val+q[q[id].r].val+q[id].val;
	}
	void Split(int id,T key,int& idX,int& idY){
		if(id==0){
			idX=idY=0;
			return;
		}
		if(q[id].val<=key){
			idX=id;
			Split(q[id].r,key,q[id].r,idY);
		}
		else{
			idY=id;
			Split(q[id].l,key,idX,q[id].l);
		}
		Update(id);
	}
	int Merge(int l,int r){
		if(l==0 || r==0) return l+r;
		if(q[l].rnd<=q[r].rnd){
			q[r].l=Merge(l,q[r].l);
			Update(r);
			return r;
		}
		else{
			q[l].r=Merge(q[l].r,r);
			Update(l);
			return l;
		}
	}
public:
	fhqTreap(){
		init();
	}
	void init(){
		root=0; q.clear();
		Node empty_node=Node();
		q.push_back(empty_node);
	}
	void insert(T val){
		Split(root,val,rootX,rootY);
		root=Merge(Merge(rootX,New(val)),rootY);
	}
	void erase(T val){//actually, 'extract' may be more precise
		Split(root,val,rootX,rootZ);
		Split(rootX,val-1,rootX,rootY);
		rootY=Merge(q[rootY].l,q[rootY].r);
		root=Merge(Merge(rootX,rootY),rootZ);
	}
	T prev(T val){
		Split(root,val-1,rootX,rootY);
		int tmp=rootX;
		while(q[tmp].r) tmp=q[tmp].r;
		root=Merge(rootX,rootY);
		return q[tmp].val;
	}
	T next(T val){
		Split(root,val,rootX,rootY);
		int tmp=rootY;
		while(q[tmp].l) tmp=q[tmp].l;
		root=Merge(rootX,rootY);
		return q[tmp].val;
	}
	int rank(T val){//val's rank
		Split(root,val-1,rootX,rootY);
		int ans=q[rootX].siz+1;
		root=Merge(rootX,rootY);
		return ans;
	}
	T get(int rank){
		int id=root;
		while(1){
//			printf("id:%d val:%d l:%d lsiz:%d r:%d rsiz:%d|rank:%d\n",id,q[id].val,q[id].l,q[q[id].l].siz,q[id].r,q[q[id].r].siz,rank);  
			if(q[q[id].l].siz>=rank) id=q[id].l;
			else if(q[q[id].l].siz+1==rank) return q[id].val;
			else{
				rank-=(q[q[id].l].siz+1);
				id=q[id].r;
			}
		}
	}
//	void output(){
//		auto dfs=[&](auto self,int u)->void{
//			if(!u) return;
//			self(self,q[u].l);
//			debug("%d|val=%d ls=%d rs=%d\n",u,q[u].val,q[u].l,q[u].r);
//			self(self,q[u].r);
//		};
//		debug("output fhqTreap\n");
//		dfs(dfs,root);
//		debug("\n");
//	}
};

int main(){
	int n=read(),m=read(),T=read();
	fhqTreap<LL>all;
	set<int>girl;
	for(int i=1;i<=n;i++){
		a[i]=read(),b[i]=read();
		all.insert(a[i]);
		if(b[i]) girl.insert(a[i]);
	}
	for(int op,id,x,ans;T--;){
		op=read(),id=read();
		if(op==1){
			x=read();
			if(b[id]==x) continue;
			if(b[id]) girl.erase(a[id]);
			else girl.insert(a[id]);
			b[id]=x;
		}
		else{
			if(!b[id]){
				if(girl.size()){
					x=*girl.rbegin();
					all.erase(x);
					ans=(n-all.rank(a[id])<=m-1);
					all.insert(x);
				}
				else{
					debug("rank(%d)=%d\n",a[id],all.rank(a[id]));
					ans=(n+1-all.rank(a[id])<=m);
				}
			}
			else{
				x=*girl.rbegin();
				if(a[id]==x){
					ans=1;
				}
				else{
					all.erase(x);
					ans=(n-all.rank(a[id])<=m-1);
					all.insert(x);
				}
			}
			debug("girl.size()=%d\n",girl.size());
			printf("%d\n",ans);
		}
	}
	return 0;
}

/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
*/