#include <cstdio>
#include <set>
#include <cstring>

int n, m, q;
int point[510][510], color[510][510];
bool vis[510][510];
std::set<int> wincolor;
int dx[] = {0, -1, 0, 1, 0};
int dy[] = {0, 0, -1, 0, 1};

void dfs(int x, int y, int z) {
    vis[x][y] = 1;
    wincolor.insert(color[x][y]);
    for (int i = 1; i <= 4; ++i) {
        int cx = x + dx[i], cy = y + dy[i];
        if (cx >= 1 && cx <= n && cy >= 1 && cy <= m && !vis[cx][cy] && z >= point[cx][cy]) {
            dfs(cx, cy, z);
        }
    }
}

int Work(int x, int y, int z) {
    if (z < point[x][y]) return 0;
    memset(vis, 0, sizeof(vis));
    wincolor.clear();
    dfs(x, y, z);
    return wincolor.size();
}

int main() {
    freopen("card.in", "r", stdin);
    freopen("card.out", "w", stdout);
    scanf("%d %d %d", &n, &m, &q);
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            scanf("%d", &point[i][j]);
        }
    }
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            scanf("%d", &color[i][j]);
        }
    }
    
    while (q--) {
        int opt, x, y, num;
        scanf("%d %d %d %d", &opt, &x, &y, &num);
        if (opt == 1) {
            color[x][y] = num;
        } else if (opt == 2) {
            printf("%d\n", Work(x, y, num));
        } else {
            printf("???");
        } 
    }
    return 0;
}