White Rabbit has a rectangular farmland of n*m. In each of the grid there is a kind of plant. The plant in the j-th column of the i-th row belongs the a[i][j]-th type.
White Cloud wants to help White Rabbit fertilize plants, but the i-th plant can only adapt to the i-th fertilizer. If the j-th fertilizer is applied to the i-th plant (i!=j), the plant will immediately die.
Now White Cloud plans to apply fertilizers T times. In the i-th plan, White Cloud will use k[i]-th fertilizer to fertilize all the plants in a rectangle [x1[i]...x2[i]][y1[i]...y2[i]].
White rabbits wants to know how many plants would eventually die if they were to be fertilized according to the expected schedule of White Cloud.

#include<bits/stdc++.h>

using namespace std;

#define ll intmax_t

const int MAXN=;

ll mapp[MAXN];

ll farm[MAXN];

ll times[MAXN];

ll color[MAXN];

int maxx_numebr =  ;

int add_number =  ;

int m,n,k;

void insert_mex(ll *v,int a,int b,ll key)

{

    a+=;

    b+=;

    while(a<n+)

    {

        int num = a*(m+);

        int pos = b;

        while(pos<m+)

        {

            v[num+pos] += key;

            pos+= pos&(-pos);

        }a+=a&(-a);

    }

}

ll find_mex(ll *v,int a,int b)

{

    a+=;

    b+=;

    ll cntt = ;

    while(a)

    {

        int num = a*(m+);

        int pos = b;

        while(pos)

        {

            cntt += v[num+pos];

            pos -= pos&(-pos);

        }

        a-=a&(-a);

    }

    return cntt;

}

void insert(ll *v,int a,int b,int c,int d,ll key)

{

    // cout<<"coor :"<<a<<" "<<b<<endl;

    // cout<<"coor :"<<a<<" "<<d<<endl;

    // cout<<"coor :"<<c<<" "<<b<<endl;

    // cout<<"coor :"<<c<<" "<<d<<endl;

    insert_mex(v,a,b,key);

    insert_mex(v,c,d,key);

    insert_mex(v,a,d,-key);

    insert_mex(v,c,b,-key);

}

ll find(ll *v,int a,int b)

{

    ll cntt = ;

    cntt += find_mex(v,a,b);

    return cntt;

}

void init()

{

    memset(color,-,sizeof(color));

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

    {

        int pos = i*m;

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

        {

            // int ppos = pos +j;

            scanf("%d",&mapp[pos]);

            if(color[pos] == -)color[mapp[pos]] = (maxx_numebr += (add_number++));

            pos++;

        }

    }

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

    {

        int a,b,c,d,kk;

        scanf("%d%d%d%d%d",&a,&b,&c,&d,&kk);

        if(color[kk] == -)color[kk] = (maxx_numebr += add_number++ );

        ll key = color[kk];

        a--;b--;

        insert(farm,a,b,c,d,key);

        insert(times,a,b,c,d,);

    }

    int cntt = n*m;

    int pos = ;

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

    {

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

        {

            // int pos = i*(m+23)+j;

            ll kk = color[mapp[pos]];

            int time_now = find(times,i,j);

            ll res = find(farm,i,j);

            // cout<<"check: "<<i<<" "<<j<<" times: "<<time_now<<" color "<<mapp[pos]<<endl;

            if(time_now ==  || res == time_now*kk)cntt--;

            pos++;

        }

    }

    cout<<cntt<<endl;

}

int main()

{

    cin>>n>>m>>k;

    init();

    return ;

}