#include <bits/stdc++.h>
using namespace std;
const int N = 5020;
int n, k, q, op;
int a[N][N];

int main(){
    freopen("breeding.in", "r", stdin);
    freopen("breeding.out", "w", stdout);
    cin >> n >> k >> q;
    for(int i = 1;i <= k;i++){
        for(int j = 1;j <= n;j++){
            cin >> a[i][j];
        }
    }
    while(q--){
        cin >> op;
        if(op == 1){
            int x, y;
            cin >> x >> y;
            ++k;
            for(int i = 1;i <= n;i++){
                a[k][i] = max(a[x][i], a[y][i]);
            }
        }
        else if(op == 2){
            int x, y;
            cin >> x >> y;
            ++k;
            for(int i = 1;i <= n;i++){
                a[k][i] = min(a[x][i], a[y][i]);
            } 
        }
        else{
            int x, y;
            cin >> x >> y;
            cout<<a[x][y]<<endl;
        }
    }
//    for(int i = 1;i <= k;i++){
//        for(int j = 1;j <= n;j++){
//            cout<<a[i][j]<<' ';
//        }
//        cout<<endl;
//    }
}