#include<bits/stdc++.h>
#define LL long long
#define ULL unsigned long long#define scl(i) scanf("%lld", &i)
#define scll(i, j) scanf("%lld %lld", &i, &j)
#define sclll(i, j, k) scanf("%lld %lld %lld", &i, &j, &k)
#define scllll(i, j, k, l) scanf("%lld %lld %lld %lld", &i, &j, &k, &l)#define scs(i) scanf("%s", i)
#define sci(i) scanf("%d", &i)
#define scd(i) scanf("%lf", &i)
#define scIl(i) scanf("%I64d", &i)
#define scii(i, j) scanf("%d %d", &i, &j)
#define scdd(i, j) scanf("%lf %lf", &i, &j)
#define scIll(i, j) scanf("%I64d %I64d", &i, &j)
#define sciii(i, j, k) scanf("%d %d %d", &i, &j, &k)
#define scddd(i, j, k) scanf("%lf %lf %lf", &i, &j, &k)
#define scIlll(i, j, k) scanf("%I64d %I64d %I64d", &i, &j, &k)
#define sciiii(i, j, k, l) scanf("%d %d %d %d", &i, &j, &k, &l)
#define scdddd(i, j, k, l) scanf("%lf %lf %lf %lf", &i, &j, &k, &l)
#define scIllll(i, j, k, l) scanf("%I64d %I64d %I64d %I64d", &i, &j, &k, &l)#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
#define lowbit(i) (i & (-i))
#define mem(i, j) memset(i, j, sizeof(i))#define fir first
#define sec second
#define VI vector<int>
#define ins(i) insert(i)
#define pb(i) push_back(i)
#define pii pair<int, int>
#define VL vector<long long>
#define mk(i, j) make_pair(i, j)
#define all(i) i.begin(), i.end()
#define pll pair<long long, long long>#define _TIME 0
#define _INPUT 0
#define _OUTPUT 0
clock_t START, END;
void __stTIME();
void __enTIME();
void __IOPUT();
using namespace std;
const int maxn = 1e6 + 100;struct ARR{int r, c, op;ARR(){};ARR(int _r, int _c, int _o):r(_r), c(_c), op(_o){};bool operator < (const ARR & rhs) const{if(r == rhs.r && c == rhs.c) return abs(op) > abs(rhs.op);if(r == rhs.r) return c < rhs.c;return r < rhs.r;}
}; vector<ARR> arr[maxn];int n, m, T;
int Cnt[maxn<<1];
int Bit[maxn];inline void BitAdd(int i, int val)
{while(i <= m){Bit[i] += val;i += (i & (-i));}
}int BitSum(int i)
{if(i == 0) return 0;int ret = 0;while(i > 0){ret += Bit[i];i -= (i & (-i));}return ret;
}void BitClean(int i)
{while(i <= m){Bit[i] = 0;i += (i & (-i));}
}int idx(int r, int c)
{ return r * m + c; }int main(void){__stTIME();__IOPUT();sciii(n, m, T);for(int i=1; i<=n; i++)for(int j=1; j<=m; j++){int tmp; sci(tmp);arr[tmp].pb(ARR(i, j, 0));}for(int i=0; i<T; i++){int x1, y1, x2, y2, k;sciiii(x1, y1, x2, y2); sci(k);arr[k].pb(ARR(x1, y1, 1));arr[k].pb(ARR(x1, y2+1, -1));arr[k].pb(ARR(x2+1, y1, -1));arr[k].pb(ARR(x2+1, y2+1, 1));Cnt[idx(x1, y1)]++;Cnt[idx(x1, y2+1)]--;Cnt[idx(x2+1, y1)]--;Cnt[idx(x2+1, y2+1)]++;}for(int i=1; i<=n; i++)for(int j=1; j<=m; j++)Cnt[idx(i, j)] += Cnt[idx(i-1, j)] +Cnt[idx(i, j-1)] -Cnt[idx(i-1, j-1)];//    for(int i=1; i<=n; i++,puts(""))
//        for(int j=1; j<=m; j++)
//            printf("%d ", Cnt[idx(i, j)]);int ans = 0;for(int i=1; i<=n*m; i++){sort(all(arr[i]));//printf("----- %d ------\n", i);for(int j=0; j<(int)arr[i].size(); j++){//printf("$$=> %d %d %d\n", arr[i][j].r, arr[i][j].c, arr[i][j].op);if(arr[i][j].op == 0){if(Cnt[idx(arr[i][j].r, arr[i][j].c)] != BitSum(arr[i][j].c))ans++;}else BitAdd(arr[i][j].c, arr[i][j].op);}for(int j=0; j<(int)arr[i].size(); j++){if(arr[i][j].op != 0)BitClean(arr[i][j].c);}}printf("%d\n", ans);__enTIME();return 0;}void __stTIME()
{#if _TIMESTART = clock();#endif
}void __enTIME()
{#if _TIMEEND = clock();cerr<<"execute time = "<<(double)(END-START)/CLOCKS_PER_SEC<<endl;#endif
}void __IOPUT()
{#if _INPUTfreopen("in.txt", "r", stdin);#endif#if _OUTPUTfreopen("out.txt", "w", stdout);#endif
}