#include<bits/stdc++.h>
#define int long long
using namespace std;

const int N = 505;
const int V = 2.5e5 + 5;

int r,c,q,ans;

int dx[5] = {0,1,0,-1,0};
int dy[5] = {0,0,1,0,-1};

int a[N][N];
int b[N][N];

bool t[V];
bool vis[N][N];

void dfs(int x,int y,int z){
    for(int i = 1;i <= 4;i++){
        int xx = x + dx[i],yy = y + dy[i];
        if(xx >= 1 && xx <= r && yy >= 1 && yy <= c && !vis[xx][yy] && a[xx][yy] <= z){
//            cout<<xx<<"  "<<yy<<'\n';
            if(!t[b[xx][yy]]){
                ans++;
                t[b[xx][yy]] = 1;
            }
            vis[xx][yy] = 1;
            dfs(xx,yy,z);
        }
    }
}

void solve(int x,int y,int z){
    memset(vis,0,sizeof(vis));
    memset(t,0,sizeof(t));
    ans = 0;
    if(a[x][y] <= z){
        vis[x][y] = 1;ans = 1;
        t[b[x][y]] = 1;
        dfs(x,y,z);
    }
    
    cout<<ans<<'\n';
    
}

signed main()
{
    freopen("card.in","r",stdin);
    freopen("card.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin>>r>>c>>q;
    for(int i = 1;i <= r;i++) for(int j = 1;j <= c;j++) cin>>a[i][j];
    for(int i = 1;i <= r;i++) for(int j = 1;j <= c;j++) cin>>b[i][j];
    
    while(q--){
        int op,x,y,z;cin>>op>>x>>y>>z;
        if(op == 1) b[x][y] = z;
        else solve(x,y,z);
//        cout<<"\n\n";
    }
    
    return 0;
}