#include <iostream>
using namespace std;
const int N = 5e3 + 30;
int a[N][N];
int main() {
    freopen("breeding.in", "r", stdin);
    freopen("breeding.out", "w", stdout);
    int n, k, q;
    cin >> n >> k >> q;
    for (int i = 1; i <= k; i++) {
        for (int j = 1; j <= n; j++) {
            cin >> a[i][j];
        }
    }
    while (q--) {
        int op, x, y;
        cin >> op >> x >> y;
        if (op == 1) {
            k++;
            for (int i = 1; i <= n; i++) {
                a[k][i] = max(a[x][i], a[y][i]);
            }
        } else if (op == 2) {
            k++;
            for (int i = 1; i <= n; i++) {
                a[k][i] = min(a[x][i], a[y][i]);
            }
        } else {
            cout << a[x][y] << endl;
        }
    }
    return 0;
}