// Problem: P9358 [ICPC2022 Xi'an R] Bridge
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P9358
// Memory Limit: 512 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<int, int> pii;

const int maxn = 500100;

int n, m, q;
set<pii> S[maxn];

int ls[maxn], rs[maxn], p[maxn], sz[maxn], rt[maxn], fa[maxn], nt;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
struct node {
	int l, r, x;
	node(int a = 0, int b = 0, int c = 0) : l(a), r(b), x(c) {}
} val[maxn];

map<node, int> mp;

inline bool operator < (const node &a, const node &b) {
	return a.l < b.l || (a.l == b.l && a.x < b.x);
}

inline int newnode(node x) {
	int u = ++nt;
	val[u] = x;
	mp[x] = u;
	p[u] = rnd();
	sz[u] = 1;
	return u;
}

inline void pushup(int x) {
	sz[x] = sz[ls[x]] + sz[rs[x]] + 1;
	if (ls[x]) {
		fa[ls[x]] = x;
	}
	if (rs[x]) {
		fa[rs[x]] = x;
	}
}

void split(int u, int k, int &x, int &y) {
	if (!u) {
		x = y = 0;
		return;
	}
	if (val[u].r <= k) {
		x = u;
		split(rs[u], k, rs[u], y);
	} else {
		y = u;
		split(ls[u], k, x, ls[u]);
	}
	pushup(u);
}

int merge(int x, int y) {
	if (!x || !y) {
		return x + y;
	}
	if (p[x] < p[y]) {
		rs[x] = merge(rs[x], y);
		pushup(x);
		return x;
	} else {
		ls[y] = merge(x, ls[y]);
		pushup(y);
		return y;
	}
}

inline int getrt(int x) {
	while (fa[x]) {
		x = fa[x];
	}
	return x;
}

inline int query(int x) {
	while (rs[x]) {
		x = rs[x];
	}
	return val[x].x;
}

inline int erase(node u) {
	int rt = getrt(mp[u]), x, y, z;
	split(rt, u.r, x, z);
	split(x, u.l - 1, x, y);
	return rt = merge(x, z);
}

inline void insert(int &rt, node u) {
	int x, y;
	split(rt, u.r, x, y);
	rt = merge(merge(x, newnode(u)), y);
}

void solve() {
	scanf("%d%d%d", &n, &m, &q);
	for (int i = 1; i <= n; ++i) {
		S[i].emplace(0, m);
		rt[i] = newnode(node(0, m, i));
	}
	while (q--) {
		int op, x, y;
		scanf("%d%d", &op, &x);
		if (op == 1) {
			scanf("%d", &y);
			auto i = --S[x].lower_bound(mkp(y, 0)), j = --S[x + 1].lower_bound(mkp(y, 0));
			pii p1 = *i, p2 = *j;
			int r1 = erase(node(p1.fst, p1.scd, x));
			int r2 = erase(node(p2.fst, p2.scd, x + 1));
			S[x].erase(i);
			S[x + 1].erase(j);
			S[x].emplace(p1.fst, y - 1);
			S[x].emplace(y, p1.scd);
			S[x + 1].emplace(p2.fst, y - 1);
			S[x + 1].emplace(y, p2.scd);
			insert(r1, node(p1.fst, y - 1, x));
			insert(r1, node(y, p1.scd, x));
			insert(r2, node(p2.fst, y - 1, x + 1));
			insert(r2, node(y, p2.scd, x + 1));
			int xa, ya, xb, yb;
			split(r1, y - 1, xa, ya);
			split(r2, y - 1, xb, yb);
			r1 = merge(xa, yb);
			r2 = merge(xb, ya);
			fa[r1] = fa[r2] = 0;
		} else {
			pii p = *S[x].begin();
			printf("%d\n", query(getrt(mp[node(p.fst, p.scd, x)])));
		}
	}
}

int main() {
	int T = 1;
	// scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}