#include<bits/stdc++.h>
using namespace std;
int a[1001][1001],b[1001][1001],d[1001][1001],n,m,k,l1,l2,r1,r2,p,t;
int main(){
	scanf("%d%d%d",&n,&m,&k);
    for(int i=1;i<=n;i++){
    	for(int j=1;j<=m;j++){
    		scanf("%d",&a[i][j]);
			b[i][j]=a[i][j]-(a[i][j-1]+a[i-1][j]-a[i-1][j-1]); 
		}
	}
	while(k--){
		scanf("%d%d%d%d%d",&l1,&l2,&r1,&r2,&p);
		b[l1][l2]+=p;//x1 y1
		b[r1+1][l2]-=p;//x2 y1
		b[l1][r2+1]-=p;//x1 y2
		b[r1+1][r2+1]+=p;//x2 y2
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			d[i][j]=d[i-1][j]+d[i][j-1]-d[i-1][j-1]+b[i][j];
			printf("%d ",d[i][j]);
		}
		printf("\n");
	}
    return 0;
}
/*
3 4 3
1 2 2 1
3 2 2 1
1 1 1 1
1 1 2 2 1
1 3 2 3 2
3 1 3 4 1
*/
/**************************************************************
	Problem: 2351
	User: huangsheng
	Language: C++
	Result: Accepted
	Time:4 ms
	Memory:13820 kb
****************************************************************/