#include<bits/stdc++.h>
#define ll long long
#define mid ((l+r)>>1)
#define lc (root<<1)
#define rc (root<<1|1)
using namespace std;
const int N = 1e3+7;
struct node
{
    int x;
    int y;
    int z;
    int t;
    bool operator < (const node & an)const
    {
        return t < an.t;
    }
};
int a[N][N];
int cx[N], cy[N];
vector<node> vec;
node ox[N], oy[N];
int main()
{
    int n, m, q;
    freopen("AABA.in", "r", stdin);
    freopen("AABA.out", "w", stdout);
    scanf("%d%d%d", &n, &m, &q);
    for(int i = 1; i <= q; i++)
    {
        int x, y, z;
        scanf("%d%d%d", &x, &y, &z);
        if(x==1)
        {
            ox[y] = (node){y, 0, z, cx[y]=i};
        }
        else
        {
            oy[y] = (node){0, y, z, cy[y]=i};
        }
    }
    for(int i = 1; i <= n; i++)
    {
        if(cx[i])
        {
           vec.push_back(ox[i]);
        }
    }
    for(int i = 1; i <= m; i++)
    {
        if(cy[i])
        {
            vec.push_back(oy[i]);
        }
    }
    sort(vec.begin(), vec.end());
    for(int i = 0; i < vec.size(); i++)
    {
        if(vec[i].x)
        {
            for(int j = 1; j <= m; j++)
            {
                a[vec[i].x][j] = vec[i].z;
            }
        }
        if(vec[i].y)
        {
            for(int j = 1; j <= n; j++)
            {
                a[j][vec[i].y] = vec[i].z;
            }
        }
    }
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= m; j++)
        {
            printf("%d ", a[i][j]);
        }
        puts("");
    }
    return 0;
}