#include<iostream>

#include<cstdio>

#include<algorithm>

#include<cstring>

using namespace std;

int read()

{

    int x=,f=; char ch=getchar();

    while (ch<'' || ch>'') {if (ch=='-') f=-; ch=getchar();}

    while (ch>='' && ch<='') {x=x*+ch-''; ch=getchar();}

    return x*f;

}

int n,m,q;int zt[][];

struct Treenode

{

    int tree[][];

    Treenode(){memset(tree,,sizeof(tree));}

    int lowbit(int x){return x&-x;}

    void change(int x,int y,int del)

        {

            for (int i=x; i<=n; i+=lowbit(i))

                for (int j=y; j<=m; j+=lowbit(j))

                    tree[i][j]+=del;

        }

    int query(int x,int y)

        {

            int ans=;

            for (int i=x; i; i-=lowbit(i))

                for (int j=y; j; j-=lowbit(j))

                    ans+=tree[i][j];

            return ans;

        }

    int ask(int x1,int y1,int x2,int y2)

        {

            return query(x2,y2)-query(x2,y1-)-query(x1-,y2)+query(x1-,y1-);

        }

}color[];

int main()

{

    n=read(); m=read();

    for (int i=; i<=n; i++)

        for (int col,j=; j<=m; j++)

            col=read(),color[col].change(i,j,),zt[i][j]=col;

    q=read();

    for (int i=; i<=q; i++)

        {

            int opt=read(),x1,y1,x2,y2,col;

            if (opt==)

                {

                    x1=read(),y1=read(),col=read();

                    color[zt[x1][y1]].change(x1,y1,-);

                    zt[x1][y1]=col;

                    color[col].change(x1,y1,);

                    continue;

                }

            x1=read(),x2=read(),y1=read(),y2=read(),col=read();

            printf("%d\n",color[col].ask(x1,y1,x2,y2));

         }

    return ;

}