#include <algorithm>
#include <cstdio>

int main()
{
	int m, n, p;
	int map[1002][1002] = {0, };
	int change[1002][1002] = {0, };

	FILE *fin = fopen("input.txt", "r");
	FILE *fout = fopen("output.txt", "w");

	fscanf(fin, "%d %d %d", &m, &n, &p);

	while(0 < p--)
	{
		int y1, x1, y2, x2, c;
		fscanf(fin, "%d %d %d %d %d", &y1, &x1, &y2, &x2, &c);
		
		for(int i=y1; i<=y2; i++)
		{
			change[i][x1] += c;
			change[i][x2+1] -= c;
		}
	}

	int changeSum = 0;

	for(int i=1; i<=m; i++)
	{
		for(int j=1; j<=n; j++)
		{
			changeSum += change[i][j];
			map[i][j] += changeSum;
			fprintf(fout, "%d ", map[i][j]);
		}
		
		fprintf(fout, "\n");
		changeSum += change[i][n+1];
	}

	fclose(fin);
	fclose(fout);
		
	return 0;
}