#include <iostream>
#include <cstdio>
using namespace std;
const int N=5005;
int n,k,q,a[N][N];
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]);
		}
	}
	int o,x,y;
	while(q--){
		scanf("%d %d %d",&o,&x,&y);
		if(o==1){
			++k;
			for(int i=1;i<=n;i++){
				a[k][i]=max(a[x][i],a[y][i]);
			}
		}else if(o==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;
}