#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
__gnu_pbds ::tree<pair<int, int>, __gnu_pbds::null_type, less<pair<int, int> >,
                  __gnu_pbds::rb_tree_tag,
                  __gnu_pbds::tree_order_statistics_node_update>
    s,S;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n,m,q;
    cin >> n >> m >> q;
    m --;
    vector<int> a(n),b(n);
    for(int i = 0;i < n;i ++) {
        cin >> a[i] >> b[i];
        a[i] = -a[i];
        if(b[i] == 1) {
            S.insert({a[i],b[i]});
        }
        s.insert({a[i],b[i]});
    }
    for(int i = 0;i < q;i ++) {
        int opt,x;
        cin >> opt >> x;
        x --;
        if(opt == 1) {
            int y;
            cin >> y;
            if(b[x] == y)continue;
            else {
                s.erase({a[x],b[x]});
                b[x] = y;
                s.insert({a[x],b[x]});
                if(y == 1) {
                    S.insert({a[x],b[x]});
                }else {
                    S.erase({a[x],b[x]});
                }
            }
        }else {
            if(b[x] == 1) {
                // cout << S.order_of_key({a[x],b[x]}) << endl;
                if(s.order_of_key({a[x],b[x]}) <= m) {
                    cout << 1 << "\n";
                }
                else if(S.order_of_key({a[x],b[x]}) == 0) {
                    cout << 1 << "\n";
                }else cout << 0 << "\n";
            }
            else if(S.size() == 0) {
                if(s.order_of_key({a[x],b[x]}) <= m) {
                    cout << 1 << "\n";
                }else cout << 0 << "\n";
            }
            else {
                auto t = *S.begin();
                int mm = m;
                if(s.order_of_key(t) > m) {
                    mm --;
                }
                // cerr << s.order_of_key({a[x],b[x]}) << endl;
                if(s.order_of_key({a[x],b[x]}) <= m) {
                    cout << 1 << "\n";
                }else cout << 0 << "\n";
            }
        }
    }
}

// 1 0 0 1 0 0 
// 0 1 0 0 1 0
// 0 0 0 0 0 0
// 1 0 0 1 0 0