Problem: Kris works in a large company "Blake Technologies". As a best engineer of the company he was assigned a task to develop a printer that will be able to print horizontal and vertical strips. First prototype is already built and Kris wants to tests it. He wants you to implement the program that checks the result of the printing.

Printer works with a rectangular sheet of paper of size n × m. Consider the list as a table consisting of n rows and m columns. Rows are numbered from top to bottom with integers from 1 to n, while columns are numbered from left to right with integers from 1 to m. Initially, all cells are painted in color 0.

Your program has to support two operations: 

  1. Paint all cells in row ri in color ai; 
  2. Paint all cells in column ci in color ai. 



If during some operation i there is a cell that have already been painted, the color of this cell also changes to ai.

Your program has to print the resulting table after k operation.

Input

The first line of the input contains three integers n, m and k (1 ≤ n, m ≤ 5000, n·m ≤ 100 000, 1 ≤ k ≤ 100 000) — the dimensions of the sheet and the number of operations, respectively.

Each of the next k lines contains the description of exactly one query: 

  * 1 ri ai (1 ≤ ri ≤ n, 1 ≤ ai ≤ 109), means that row ri is painted in color ai; 
  * 2 ci ai (1 ≤ ci ≤ m, 1 ≤ ai ≤ 109), means that column ci is painted in color ai. 

Output

Print n lines containing m integers each — the resulting table after all operations are applied.

Examples

Input

3 3 3
1 1 3
2 2 1
1 2 2


Output

3 1 3 
2 2 2 
0 1 0 


Input

5 3 5
1 1 1
1 3 1
1 5 1
2 1 1
2 3 1


Output

1 1 1 
1 0 1 
1 1 1 
1 0 1 
1 1 1 

Note

The figure below shows all three operations for the first sample step by step. The cells that were painted on the corresponding step are marked gray. 

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
double squareRoot(double n) { return pow(2, 0.5 * log2(n)); }
ll gcd(ll a, ll b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
bool pal(string& s) {
  for (int i = 0; i < s.size() / 2; i++) {
    if (s[i] != s[s.size() - i - 1]) return 0;
  }
  return 1;
}
ll MOD = 1000000007;
ll powmod(ll a, ll b, ll m) {
  if (b == 0) return 1;
  if (b == 1) return a;
  ll p1 = powmod(a, b / 2ll, m);
  ll p2 = p1 * p1;
  ll p3 = powmod(a, b % 2ll, m);
  return ((p2 % m) * (p3 % m)) % m;
}
ll modpow(ll a, ll b, ll x) {
  ll res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a) % x;
    a = (a * a) % x;
    b >>= 1;
  }
  return res;
}
ll ncr(ll n, ll r) {
  if (n == 0 || r == 0) return 1;
  if (r > n) return 0;
  if (n - r < r) r = n - r;
  ll ans = 1;
  for (ll i = 1; i <= r; i++) {
    ans = ans * (n - i + 1) / i;
  }
  return ans;
}
bool cmp(pair<ll, ll>& a, pair<ll, ll>& b) {
  return (a.second - a.first < b.second - b.first);
}
bool bruteprime(ll n) {
  if (n == 1) return 0;
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0) return 0;
  }
  return 1;
}
vector<ll> primefactors(ll n) {
  vector<ll> ans;
  while (n % 2 == 0) {
    ans.push_back(2);
    n /= 2;
  }
  for (int i = 3; i * i <= n; i += 2) {
    while (n % i == 0) {
      ans.push_back(i);
      n /= i;
    }
  }
  if (n > 2) ans.push_back(n);
  return ans;
}
vector<ll> factors(ll n) {
  vector<ll> ans;
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      ans.push_back(i);
      if (n / i != i) {
        ans.push_back(n / i);
      }
    }
  }
  return ans;
}
void computeLPSArray(string pat, int M, int* lps);
int KMPSearch(string pat, string txt) {
  int M = pat.size();
  int N = txt.size();
  int lps[M];
  computeLPSArray(pat, M, lps);
  int i = 0;
  int j = 0;
  int ans = 0;
  while (i < N) {
    if (pat[j] == txt[i]) {
      j++;
      i++;
    }
    if (j == M) {
      ans++;
      j = lps[j - 1];
    } else if (i < N && pat[j] != txt[i]) {
      if (j != 0)
        j = lps[j - 1];
      else
        i = i + 1;
    }
  }
  return ans;
}
void computeLPSArray(string pat, int M, int* lps) {
  int len = 0;
  lps[0] = 0;
  int i = 1;
  while (i < M) {
    if (pat[i] == pat[len]) {
      len++;
      lps[i] = len;
      i++;
    } else {
      if (len != 0) {
        len = lps[len - 1];
      } else {
        lps[i] = 0;
        i++;
      }
    }
  }
}
void solve() {
  ll n, m;
  cin >> n >> m;
  ll k;
  cin >> k;
  ll arr[n][m];
  memset(arr, 0, sizeof(arr));
  unordered_map<ll, pair<ll, ll>> mr, mc;
  for (int i = 0; i < (k); ++i) {
    ll a, b, c;
    cin >> a >> b >> c;
    if (a == 1) {
      mr[b] = {i, c};
    } else {
      mc[b] = {i, c};
    }
  }
  for (int i = 0; i < (n); ++i) {
    for (int j = 0; j < (m); ++j) {
      if (mr.find(i + 1) == mr.end() && mc.find(j + 1) == mc.end())
        cout << "0 ";
      else {
        if (mr.find(i + 1) == mr.end())
          cout << mc[j + 1].second << " ";
        else if (mc.find(j + 1) == mc.end())
          cout << mr[i + 1].second << " ";
        else {
          cout << (mr[i + 1].first > mc[j + 1].first ? mr[i + 1].second
                                                     : mc[j + 1].second)
               << " ";
        }
      }
    }
    cout << "\n";
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int t;
  t = 1;
  for (int i = 1; i <= t; i++) {
    solve();
  }
  return 0;
}