#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int n,k,q;
int a[15][100005];
int opt,x,y;
int cnt;
struct node{
    int id;
    int x,y;
}h[100015];
int find(int u,int d){
    if(u<=k)    return a[u][d];
    if(h[u].id==1)  return max(find(h[u].x,d),find(h[u].y,d));
    return min(find(h[u].x,d),find(h[u].y,d));
}
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]);
        }
    }
    cnt=k;
    for(int i=1;i<=q;i++){
        scanf("%d%d%d",&opt,&x,&y);
        if(opt==1||opt==2){
            cnt++;
            h[cnt].id=opt;
            h[cnt].x=x;
            h[cnt].y=y;
        }else{
            printf("%d\n",find(x,y));
        }
    }
    return 0;
}