#include<map>
#include<queue>
#include<cmath> 
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define R register
#define ll long long
#define inf 707406378


inline void in(int &x) {
    static int ch; static bool flag;
    for(flag = false,ch = getchar();ch < '0'||ch > '9';ch = getchar()) flag |= ch == '-';
    for(x = 0;isdigit(ch);ch = getchar()) x = (x<<1) + (x<<3) + ch - '0';
    x = flag ? -x : x;
}

inline void write(int x){
    if(x<0) putchar('-'),x=-x;
    if(x>9) write(x/10);
    putchar(x%10+'0');
}


int n,m,l;
int b[1005][1005];
struct node{int a1,a2,b1,b2,col;}a[5005];



inline int dy(){
	freopen("lostmonkey.in","r",stdin);
	freopen("lostmonkey.out","w",stdout);
    in(n),in(m),in(l);
	for(int i=1;i<=l;++i){
		R int a1,a2,b2,b1;
		in(a1),in(a2),in(b1),in(b2),in(a[i].col);
		a[i].a1=min(a1,a2);a[i].a2=max(a1,a2);
		a[i].b1=min(b1,b2);a[i].b2=max(b1,b2);
	}
	for(int i=l;i;--i)
		for(int x=a[i].a1;x<=a[i].a2;++x)
			for(int y=a[i].b1;y<=a[i].b2;++y)
				if(!b[x][y])b[x][y]=a[i].col;
	for(int i=1;i<=n;++i,putchar('\n'))
		for(int j=1;j<=m;++j)write(b[i][j]);
}

int QAQ = dy();

int main(){;}