#include<cstdio>
#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;
int shu[1001][1001]={0};
int n,m,k,ll,x1,y1,x2,y2;
int lowbit(int x){return x&-x;}
int main()
{
	freopen("lostmonkey.in","r",stdin);
	freopen("lostmonkey.out","w",stdout);
	scanf("%d%d%d",&n,&m,&k);//n*m的布,精灵染k次
	for(int i=1;i<=k;i++)
	{
		scanf("%d%d%d%d%d",&x1,&y1,&x2,&y2,&ll);//x1,y1,x2,y2,ll表示矩形从(x1,y1)―(x2,y2) 染成颜色ll
		for(int p=y1;p<=y2;p++)
		for(int l=x1;l<=x2;l++)
		shu[p][l]=ll;
	}
	for(int i=1;i<=n;i++)
	{
		for(int p=1;p<=m;p++)printf("%d",shu[p][i]);
		printf("\n");
	}
	return 0;
}