#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
using namespace std;
typedef long long  LL;
typedef unsigned long long uLL;
typedef pair<LL,LL> PII;
const int N = 2e5+10;
const int inf = 0x3f3f3f3f;
const double pi = acos(-1);
#define debug(x) cout<<"[debug]"#x<<"="<<x<<'\n';
template <int T>
struct ModInt {
    const static int MD = T;
    int x;
    ModInt(LL x = 0)
        : x(x % MD) {}
    int get() { return x; }
    ModInt operator+(const ModInt& that) const {
        int x0 = x + that.x;
        return ModInt(x0 < MD ? x0 : x0 - MD);
    }
    ModInt operator-(const ModInt& that) const {
        int x0 = x - that.x;
        return ModInt(x0 < MD ? x0 + MD : x0);
    }
    ModInt operator*(const ModInt& that) const {
        return ModInt((long long)x * that.x % MD);
    }
    ModInt operator/(const ModInt& that) const {
        return *this * that.inverse();
    }
    void operator+=(const ModInt& that) {
        x += that.x;
        if (x >= MD)
            x -= MD;
    }
    void operator-=(const ModInt& that) {
        x -= that.x;
        if (x < 0)
            x += MD;
    }
    void operator*=(const ModInt& that) { x = (long long)x * that.x % MD; }
    void operator/=(const ModInt& that) { *this = *this / that; }
    ModInt inverse() const {
        int a = x, b = MD, u = 1, v = 0;
        while (b) {
            int t = a / b;
            a -= t * b;
            std::swap(a, b);
            u -= t * v;
            std::swap(u, v);
        }
        if (u < 0)
            u += MD;
        return u;
    }
    friend ostream& operator<<(ostream& os, ModInt x) {
        os << x.get();
        return os;
    }
};//全局变量记得清零！
const int mod=998244353;
typedef ModInt<mod> mint;
LL gcd(LL a, LL b)
{
   return b ? gcd(b, a % b) : a;
}
void solve()
{
   int n,m,q;
   cin>>n>>m>>q;
   vector<PII>a(n);
   map<LL,LL>mp;
   vector<PII>g;
   for(int i=0;i<n;i++){
       cin>>a[i].first>>a[i].second;
       mp[i]=a[i].first;
   }
       int cur=m,curpos=-1;
       sort(a.rbegin(),a.rend());
       cur=m;
       for(int i=0;i<n;i++){
           if(a[i].second==1){
               curpos=i;
               cur--;break;
           }
       }
   while(q--){
     int op;cin>>op;
     if(op==1){
        int pos,gen;
       cin>>pos>>gen;
       for(int i=0;i<n;i++){
           if(mp[pos-1]==a[i].first){
              a[i].second=gen;
           }
       }
       sort(a.rbegin(),a.rend());
       cur=m;curpos=-1;
       for(int i=0;i<n;i++){
           if(a[i].second==1){
               curpos=i;
               cur--;break;
           }
       }
     }else{
       int p;cin>>p;
       bool fl=false;
       //cout<<curpos<<" ";
       for(int i=0;i<cur;i++){
           if(mp[p-1]==a[i].first) {
               fl=true;
           }
       }
       if(fl||mp[p]==curpos) cout<<1<<'\n';
       else cout<<0<<'\n';
     }
   }
}
int main()
{
   ios::sync_with_stdio(0); cin.tie(0),cout.tie(0);
   solve();
}