Codeforces Round #344 (Div. 2) B

B. Print Check

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 r_i in color a_i;
2. Paint all cells in column c_i in color a_i.

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

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 r_i a_i (1 ≤ r_i ≤ n, 1 ≤ a_i ≤ 10⁹), means that row r_i is painted in color a_i;
• 2 c_i a_i (1 ≤ c_i ≤ m, 1 ≤ a_i ≤ 10⁹), means that column c_i is painted in color a_i.

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

题意： n*m的矩阵 两种操作 整行变换 与整列变换

1 r_i a_i (1 ≤ r_i ≤ n, 1 ≤ a_i ≤ 10⁹), means that row r_i is painted in color a_i; 整行变为a

2 c_i a_i (1 ≤ c_i ≤ m, 1 ≤ a_i ≤ 10⁹), means that column c_i is painted in color a_i. 整列变为a

输出k次变换后的矩阵；

题解：判断每一个位置上的数 其所在行的变换与所在列的变换的先后顺序以及变换结果  变换在后的 为结果  无变化的输出0；

 #include<iostream>
 #include<cstring>
 #include<cstdio>
 using namespace std;
 struct node
 {
     int sor;
     int reu;
 } a[],b[];
 int n,m,k;
 int q,w,e;
 int main()
 {
     scanf("%d %d %d",&n,&m,&k);
     memset(a,,sizeof(a));
     memset(b,,sizeof(b));
     for(int i=; i<=k; i++)
     {
         scanf("%d %d %d",&q,&w,&e);
         if(q==)
         {
             a[w].sor=i;
             a[w].reu=e;
         }
         else
         {
             b[w].sor=i;
             b[w].reu=e;
         }
     }
     for(int i=; i<=n; i++)
     {
       //  cout<<a[i].sor<<" "<<b[i].sor<<endl;
         if(a[i].sor>b[].sor)
             printf("%d",a[i].reu);
         else
         {
             if(a[i].sor<b[].sor)
                 printf("%d",b[].reu);
             else
                 printf("");
         }

         for(int j=; j<=m; j++)
         {
             if(a[i].sor>b[j].sor)
                 printf(" %d",a[i].reu);
             else
             {
                 if(a[i].sor<b[j].sor)
                     printf(" %d",b[j].reu);
                 else
                     printf("");
             }
         }
         printf("\n");
     }
     return ;
 }