#include <bits/stdc++.h>
#define ll long long
using namespace std;
int n,k,q;
int a[5020][5005];
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--)
    {
        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]<<'\n';
        }
    }
    return 0;
}