#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <cstring>

using namespace std;

int n,m,T,x[1001][1001];

void init()
{
	scanf("%d%d%d",&n,&m,&T);
}

void solve()
{
	int a1,b1,a2,b2,c;
	for (;T;--T)
	{
		scanf("%d%d%d%d%d",&a1,&b1,&a2,&b2,&c);
		for (int i=min(a1,a2);i<=max(a1,a2);i++)
		for (int j=min(b1,b2);j<=max(b1,b2);j++)
		x[i][j]=c;
	}
}

void print()
{
	for (int i=1;i<=n;i++)
	{
		for (int j=1;j<=m;j++)
		printf("%d",x[i][j]);
		printf("\n");
	}
}

int main()
{
	freopen("lostmonkey.in","r",stdin);
	freopen("lostmonkey.out","w",stdout);
	init();
	solve();
	print();
	return 0;
}