#include <bits/stdc++.h>
using namespace std;
#define ar array
#define ll long long
const int MAX_N = 1e5 + 1;
const ll INF = 1e9;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n,m, k;
cin >> n >> m >> k;
vector<int> row_arr(n+10, 0);
vector<int> row_arr_time(n+10, 0);
vector<int> col_arr(m+10, 0);
vector<int> col_arr_time(m+10, 0);
int time = 0;
while (k--) {
time++;
int flag, c, a;
cin >> flag >> c >> a;
if (flag == 1) {
row_arr[c] = a;
row_arr_time[c] = time;
} else {
col_arr[c] = a;
col_arr_time[c] = time;
}
}
for (int r = 1; r <= n; r++) {
for (int c = 1; c <= m; c++) {
if (row_arr_time[r] == 0 && col_arr_time[c] == 0) {
cout << 0 << " ";
} else if (row_arr_time[r] > col_arr_time[c]) {
cout << row_arr[r] << " ";
} else if (col_arr_time[c] > row_arr_time[r]) {
cout << col_arr[c] << " ";
}
}
cout << "\n";
}
}
20. Valid Parentheses | 746. Min Cost Climbing Stairs |
392. Is Subsequence | 70. Climbing Stairs |
53. Maximum Subarray | 1527A. And Then There Were K |
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers | 318. Maximum Product of Word Lengths |
448. Find All Numbers Disappeared in an Array | 1155. Number of Dice Rolls With Target Sum |
415. Add Strings | 22. Generate Parentheses |
13. Roman to Integer | 2. Add Two Numbers |
515. Find Largest Value in Each Tree Row | 345. Reverse Vowels of a String |
628. Maximum Product of Three Numbers | 1526A - Mean Inequality |
1526B - I Hate 1111 | 1881. Maximum Value after Insertion |
237. Delete Node in a Linked List | 27. Remove Element |
39. Combination Sum | 378. Kth Smallest Element in a Sorted Matrix |
162. Find Peak Element | 1529A - Eshag Loves Big Arrays |
19. Remove Nth Node From End of List | 925. Long Pressed Name |
1051. Height Checker | 695. Max Area of Island |