#include<iostream>
#include<cstdio>
#include<algorithm>
#include<set>
#include<cstring>
#include<queue>
using namespace std;
const int N=502;
int r,c,q;
int a[N][N],b[N][N];
set<int>s;
bool vis[N][N];
const int cz[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
queue<bool*>chd;
void dfs(int x,int y,int v){
    if(a[x][y]>v) return;
//    cout<<x<<" "<<y<<"\n";
    s.insert(b[x][y]);
    vis[x][y]=1;
    chd.push(&vis[x][y]);
    for(int i=0;i<4;i++){
        int xx=x+cz[i][0],yy=y+cz[i][1];
        if(1<=xx&&xx<=r&&1<=yy&&yy<=c&&!vis[xx][yy]){
            dfs(xx,yy,v);
        }
    }
}
int main(){
    freopen("card.in","r",stdin);
    freopen("card.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(0), cout.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,v;
        cin>>op>>x>>y>>v;
        if(op==1){
            b[x][y]=v;
        }else{
            s.clear();
            memset(vis,0,sizeof(vis));
            dfs(x,y,v);
            while(!chd.empty()){
                *chd.front()=0;
                chd.pop();
            }
            cout<<s.size()<<'\n';
        }
    }
    return 0;
}