#include <bits/stdc++.h>
const double PI = 3.141592653589793238460;
using namespace std;
long long pows(long long a, long long n, long long m) {
  long long res = 1;
  while (n) {
    if (n % 2 != 0) {
      res = (res * a) % m;
      n--;
    } else {
      a = (a * a) % m;
      n = n / 2;
    }
  }
  return res % m;
}
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
void shift(vector<int> &p) {
  int temp = p[0];
  for (int i = 1; i < p.size(); i++) {
    p[i - 1] = p[i];
  }
  p[p.size() - 1] = temp;
}
bool isprime(long long n) {
  if (n == 1) {
    return false;
  }
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      return false;
    }
  }
  return true;
}
bool istrue(string s) {
  int i = 0;
  int j = s.size() - 1;
  while (i < j) {
    if (s[i] == s[j]) {
      i++;
      j--;
    } else {
      return false;
    }
  }
  return true;
}
bool divsibleodd(long long n) {
  for (long long i = 3; i <= 100000; i = i + 2) {
    if (n % i == 0) {
      return true;
    }
  }
  return false;
}
bool cmp(pair<int, int> p1, pair<int, int> p2) {
  return ((p1.first > p2.first) ||
          (p1.first == p2.first && p1.second < p2.second));
}
int a[5001][5001];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  int ad, b, c;
  int ar1[n + 1];
  int br2[m + 1];
  for (int i = 0; i < n; i++) {
    ar1[i] = 0;
  }
  for (int i = 0; i < m; i++) {
    br2[i] = 0;
  }
  vector<pair<int, int> > vi;
  for (int i = 0; i < k; i++) {
    cin >> ad >> b >> c;
    b--;
    if (ad == 1) {
      vi.push_back({ad, b});
      ar1[b] = c;
    } else {
      vi.push_back({ad, b});
      br2[b] = c;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      a[i][j] = 0;
    }
  }
  for (int i = vi.size() - 1; i >= 0; i--) {
    int l = vi[i].first;
    int r = vi[i].second;
    if (l == 1 && ar1[r] != 0) {
      for (int j = 0; j < m; j++) {
        if (a[r][j] == 0) a[r][j] = ar1[r];
      }
      ar1[r] = 0;
    }
    if (l == 2 && br2[r] != 0) {
      for (int j = 0; j < n; j++) {
        if (a[j][r] == 0) a[j][r] = br2[r];
      }
      br2[r] = 0;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cout << a[i][j] << " ";
    }
    cout << endl;
  }
}
