#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
bitset<4100> a[200005];
int n, m, num[13][200005], cnt, k;
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> m >> n >> k;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cin >> num[i][j];
		}
		for (int j = 0; j < (1 << n); j++) {
			a[i][j] = (j >> (i - 1)) & 1;
		}
	}
	int op, p, q;
	cnt = n;
	for (int i = 1; i <= k; i++) {
		cin >> op >> p >> q;
		if (op == 1) {
			a[++cnt] = a[p] | a[q];
		} else if (op == 2) {
			a[++cnt] = a[p] & a[q];
		} else {
			int ans = -1, op = 0;
			for (int j = 1; j <= n; j++) {
				op = 0;
				for (int kk = 1; kk <= n; kk++) {
					if (num[kk][q] >= num[j][q]) op |= (1 << (kk - 1));
				}
				if (a[p][op]) ans = max(ans, num[j][q]);
			}
			cout << ans << "\n";
		}
	}
}