#include<cstdio>
#include<iostream>
using namespace std;
int n,k,q,a[5005][5050];
int main(){
    freopen("breeding.in","r",stdin);
    freopen("breeding.out","w",stdout);
    scanf("%d%d%d",&n,&k,&q);
    for(int i=1;i<=k;i++){
        for(int j=1;j<=n;j++){
            scanf("%d",&a[i][j]);
        }
    }
    while(q--){
        int op,x,y;
        scanf("%d%d%d",&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 printf("%d\n",a[x][y]);
    }
    return 0;
}