#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 n,m,q;
int solve(vector<pii>& a, vector<int>& gen,int q)
{
    int mx=0, gid;
    sort(a.begin(), a.end(), greater<pii>());
    for (auto[s, id]:a)
    {
        if (gen[id] == 1){
            if (s > mx){
                gid = id;
                mx = s;
            }
        }
    }

    if (mx == q) return 1;
    bool hasg=0;
    for (int i=0; i<m-1;i++)
    {
        if (gen[a[i].second] == 1) hasg=1;
        if (a[i].second == q) return 1;
    }
    if (!hasg && a[m-1].second == q){
        return 1;
    }
    return 0;
}

int main()
{
    priority_queue<pii> pq;
    int n,m,q;
    cin>>n>>m>>q;
    vector<pii> a(n);
    vector<int> gen(n);
    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]});
        }
    }

    while (q--)
    {   
        int t;
        cin>>t;
        if (t==1){
            int aa,b;
            cin>>aa>>b;
            gen[aa-1] = b;
        }
        else{
            int qa;
            cin>>qa;
            qa--;
            cout<<solve(a, gen, qa)<<endl;
        }
    }
    return 0;
}