#include <bits/stdc++.h>
using namespace std;
const long long N = 1e6 + 10;
const long long INF = 1e18;
const long long inf = -1e18;
const long long MOD = 1e9 + 7;
long long binpow(long long a, long long n) {
  if (n == 0) return 1;
  if (n % 2 == 1)
    return binpow(a, n - 1) * a;
  else {
    long long b = binpow(a, n / 2);
    return b * b;
  }
}
long long n, m, k, c, l, add;
pair<long long, long long> b[N], a[N];
int main() {
  cin >> n >> m >> k;
  for (int i = 1; i <= k; i++) {
    cin >> c >> l >> add;
    if (c == 1) {
      a[l].first = add;
      a[l].second = i;
    }
    if (c == 2) {
      b[l].first = add;
      b[l].second = i;
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      if (b[j].second != 0) {
        if (a[i].second > b[j].second) {
          cout << a[i].first << " ";
        } else {
          cout << b[j].first << " ";
        }
      } else {
        cout << a[i].first << " ";
      }
    }
    cout << endl;
  }
}
