#include<bits/stdc++.h>
//#pragma GCC optimize(3,"Ofast","inline")
using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long  ull;
typedef pair<int,int> pii;
typedef pair<db,db> pdd;
typedef pair<ll,ll> pll;
void init();
void debug();
#define Clear(a)  memset(a,0,sizeof(a))
#define pb(x) push_back(x)
 
#define INF 1e9+10
const int N = 1e3+10;
const int M = 13210;
const int maxn = 3e5 +10;
const ll mod = 1e9+7;

const bool IN_TEST = 1;
int gen[N];
pii a[N];
int rk[N];

int main()
{
    priority_queue<pii> pq;
    int n,m,q;
    cin>>n>>m>>q;
    int gmx=0, gid;
    for (int i=0;i<n;i++)
    {
        cin>>a[i].first>>gen[i];
        a[i].second = i;
        if (gen[i]){
            pq.push({a[i]});
        }
    }
    sort(a,a+n, greater<pii>());

    for (int i=0;i<n;i++)
    {
        rk[a[i].second] = i;
    }

    while (q--)
    {   
        int t;
        cin>>t;
        if (t==1){
            int a,b;
            cin>>a>>b;
            gen[a-1] = b;
        }
        else{
            int qa;
            cin>>qa;
            qa--;
            while (pq.size()){
                auto [score, id] = pq.top();
                if (gen[id] == 0) pq.pop();
                else break;
            }
            int bias=0;
            if (pq.size()){
                auto [score, id] = pq.top();
                bias = score >= a[m-1].first;
                if (id==qa){
                    cout<<"1\n";
                    continue;
                }
            }
            
            int ans = rk[qa] <= m-1 - bias;
            cout<<ans<<endl;
        }
    }
    return 0;
}