#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")

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

typedef long long int ll;
typedef long double ld;
typedef pair<ll, ll> pl;
typedef vector<ll> vl;
#define FD(i, r, l) for(ll i = r; i > (l); --i)

#define K first
#define V second
#define G(x) ll x; cin >> x;
#define GD(x) ld x; cin >> x;
#define GS(s) string s; cin >> s;
#define EX(x) { cout << x << '\n'; exit(0); }
#define A(a) (a).begin(), (a).end()
#define F(i, l, r) for (ll i = l; i < (r); ++i)

#define NN
#define M 1000000007 // 998244353


int main(){
//    freopen("a.in", "r", stdin);
//    freopen("a.out", "w", stdout);

    ios_base::sync_with_stdio(false); cin.tie(0);
    cout << fixed << setprecision(20);
    G(n) G(m) G(q)
    vl a(n+1), b(n+1);
    F(i, 1, n+1) cin >> a[i] >> b[i];
    while (q--) {
        G(t) G(x)
        if (t==1) b[x]^=1;
        else {
            vector<pl> g;
            ll gr = 0;
            F(i, 1, n+1) {
                if (b[i]) {
                    if (!gr || a[i] > a[gr]) gr = i; 
                }
                g.emplace_back(a[i], i);
            }
            sort(A(g));
            ll tm = m;
            bool works = x == gr;
            if (gr) g.erase(find(A(g), pair(a[gr], gr))), --tm;
            while (tm--) {
                works |= g.back().V == x; g.pop_back();
            }
            cout << works << '\n';
        }
    }
}