#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e3 + 10, M = 4e5;
ll n, m, q;
struct E
{
	ll c, id, sex, st;
} e[N], e1[N];
bool cmp(E a, E b)
{
	if (a.sex > b.sex)
		return 1;
	else if (a.sex < b.sex)
		return 0;
	return a.c > b.c;
}
bool cmp1(E a, E b)
{
	return a.c > b.c;
}
void solve()
{
	cin >> n >> m >> q;
	for (int i = 1; i <= n; i++)
	{
		cin >> e[i].c >> e[i].sex;
		e[i].id = i;
	}
	while (q--)
	{

		int op;
		cin >> op;
		if (op == 1)
		{
			int id, sex;
			cin >> id >> sex;
			e[id].sex = sex;
		}
		else
		{
			int x;
			cin >> x;
			for (int i = 1; i <= n; i++)
			{
				e1[i].c = e[i].c;
				e1[i].sex = e[i].sex;
				e1[i].id = e[i].id;
				e1[i].st = 0;
			}

			sort(e1 + 1, e1 + n + 1, cmp);
			int cnt = m;
			if (e1[1].sex == 1)
			{
				cnt--;
				e1[1].st = 1;
				sort(e1 + 2, e1 + n + 1, cmp1);
			}
			else
				sort(e1 + 1, e1 + n + 1, cmp1);

			for (int i = 1; i <= n; i++)
			{
				if (cnt == 0)
					break;
				if (!e1[i].st)
				{
					e1[i].st = 1;
					cnt--;
					if (cnt == 0)
						break;
				}
			}
			for (int i = 1; i <= n; i++)
			{
				if (e1[i].id == x)
				{
					if (e1[i].st == 1)
					{
						cout << "1\n";
					}
					else
					{
						cout << "0\n";
					}
					break;
				}
			}
		}
	}
}
int main()
{
	std::ios::sync_with_stdio(0);
	std::cin.tie(0);
	std::cout.tie(0);
	int t = 1;
	// cin >> t;
	while (t--)
		solve();
	return 0;
}