#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

const int N = 1010;
int a[N][N], b[N][N];
void ist(int x1, int y1, int x2, int y2, int x)
{
	b[x1][y1] += x;
	b[x2 + 1][y1] -= x;
	b[x1][y2 + 1] -= x;
	b[x2 + 1][y2 + 1] += x;
}

int main()
{
	int n, m, i, j;
	scanf("%d%d", &n, &m);
	for (i = 1; i <= n; i++)	// yes
	{
		for (j = 1; j <= n; j++)
		{
			scanf("%d", &a[i][j]);
		}
	}	
	for (i = 1; i <= n; i++)
	{
		for (j = 1; j <= n; j++)
		{
			ist(i, j, i, j, a[i][j]);
		}
	}
	int x1, y1, x2, y2, x;
	for (i = 1; i <= m; i++)
	{
		//puts("Yes");
		scanf("%d %d %d %d %d", &x1, &y1, &x2, &y2, &x);
		ist(x1, y1, x2, y2, x);
	}
	for (i = 1; i <= n; i++)
	{
		for (j = 1; j <= n; j++)
		{
			a[i][j] = a[i][j - 1] + a[i - 1][j] - a[i - 1][j - 1] + b[i][j];
		}
	}
	for (i = 1; i <= n; i++)
	{	
		for (j = 1; j <= n; j++)
		{
			printf("%d ", a[i][j]);
		}
		putchar('\n');
	}
	
	system("pause");
	
	return 0;
}