#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
const long long inf = 0x3f3f3f3f3f3f3f3fll;
using namespace std;
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
void d1(long long x) { cout << x << endl; }
void d2(long long x, long long y) { cout << x << " " << y << endl; }
void d3(long long x, long long y, long long z) {
  cout << x << " " << y << " " << z << endl;
}
void d4(long long w, long long x, long long y, long long z) {
  cout << w << " " << x << " " << y << " " << z << endl;
}
void da(long long a[], long long n) {
  for (long long i = 0; i < n; i++) cout << a[i] << " ";
  cout << endl;
}
void dv(vector<long long>& v) {
  for (long long i = 0; i < v.size(); i++) cout << v[i] << " ";
  cout << endl;
}
int main(int argc, char* argv[]) {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  int n, m, k, x, y, z;
  cin >> n >> m >> k;
  int a[n][m], i, j;
  for (i = 0; i < n; i++) {
    for (j = 0; j < m; j++) {
      a[i][j] = 0;
    }
  }
  while (k--) {
    cin >> x >> y >> z;
    if (x == 1) {
      for (i = 0; i < m; i++) a[y - 1][i] = z;
    } else {
      for (i = 0; i < n; i++) a[i][y - 1] = z;
    }
  }
  for (i = 0; i < n; i++) {
    for (j = 0; j < m; j++) {
      cout << a[i][j] << " ";
    }
    cout << endl;
  }
  return 0;
}
