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 JAVA):

Solution:

    import java.io.*;

    import java.math.BigInteger;
    import java.util.*;

    public class TaskC {

        static Integer[][]dp;
        static int n, m, ans;
        static String s;
        static TreeSet<Integer> primes;

        static void generatePrimes()
        {
            primes = new TreeSet<>();
            primes.add(2);

            for (int i = 3 ; i <= (1e6) ; i++,++i)
            {
                int j = 2;
                boolean isPrime = true;
                while (1l*j*j <= i)
                {
                    if(i%j == 0)
                    {
                        isPrime = false;
                        break;
                    }
                    j++;
                }
                if(isPrime)primes.add(i);
            }

        }


        public static void main(String[] args) throws Exception {

            Scanner sc = new Scanner(System.in);
            PrintWriter pw = new PrintWriter(System.out);

            int n = sc.nextInt();
            int m = sc.nextInt();
            int k = sc.nextInt();
            Pair[] row = new Pair[n];
            Pair[] col = new Pair[m];

            for (int i = 0 ; i < n ; i++)
                row[i] = new Pair(0 ,(int) -1e9);
            for (int i = 0 ; i < m ; i++)
                col[i] = new Pair(0 , (int) -1e9);
            int t = 0;
            while (k -- >0)
            {

                int q = sc.nextInt();
                int r = sc.nextInt() - 1;
                int c = sc.nextInt();
                if(q == 1)
                {
                    row[r] = new Pair(c , ++t);
                }else
                    col[r] = new Pair(c , ++t);
            }
            for (int i = 0; i < n ; i++) {
                for (int j = 0; j < m; j++) {
                    if(row[i].y > col[j].y){
                        pw.print(row[i].x + " ");
                    }else
                        pw.print(col[j].x + " ");

                }
                pw.println();
            }


            pw.close();

        }



        private static long gcd(long a, long b) {
            if( b == 0)
                return a;
            return gcd(b  , a%b);
        }

        static long lcm(int a, int b)
        {
            return (a*b)/gcd(a, b);
        }


        private  static int dis(int xa , int ya , int xb , int yb)
        {
            return (xa-xb)*(xa - xb) + (ya- yb)*(ya-yb);
        }


        static class Pair implements Comparable<Pair> {
            int x,y;


            public Pair(int x, int y) {
                this.x = x;
                this.y = y;
            }

            public int compareTo(Pair o) {
               /* if (x == o.x)
                    return y - o.y;
                return x - o.x;*/
               return  0;
            }
            public double dis(Pair a){

                return (a.x - x)*(a.x - x) + (a.y-y)*(a.y-y);
            }

            public String toString() {
                return  x+" "+ y;
            }
            public boolean overlap(Pair a)
            {
            if((this.x >= a.x && this.x <= a.y) || (a.x >= this.x && a.x <= this.y)) return true;
                return false;

            }
        }

        static class Scanner {
            StringTokenizer st;
            BufferedReader br;

            public Scanner(FileReader r) {
                br = new BufferedReader(r);
            }

            public Scanner(InputStream s) {
                br = new BufferedReader(new InputStreamReader(s));
            }

            public String next() {
                while (st == null || !st.hasMoreTokens()) {
                    try {
                        st = new StringTokenizer(br.readLine());
                    } catch (IOException e) {
                        throw new RuntimeException(e);
                    }
                }
                return st.nextToken();
            }

            public boolean check() {
                if (!st.hasMoreTokens())
                    return false;
                return true;
            }

            public int nextInt() {
                return Integer.parseInt(next());
            }

            public long nextLong() {
                return Long.parseLong(next());
            }

            public String nextLine() {
                try {
                    return br.readLine();
                } catch (Exception e) {
                    throw new RuntimeException(e);
                }
            }

            public double nextDouble() {
                String x = next();
                StringBuilder sb = new StringBuilder("0");
                double res = 0, f = 1;
                boolean dec = false, neg = false;
                int start = 0;
                if (x.charAt(0) == '-') {
                    neg = true;
                    start++;
                }
                for (int i = start; i < x.length(); i++)
                    if (x.charAt(i) == '.') {
                        res = Long.parseLong(sb.toString());
                        sb = new StringBuilder("0");
                        dec = true;
                    } else {
                        sb.append(x.charAt(i));
                        if (dec)
                            f *= 10;
                    }
                res += Long.parseLong(sb.toString()) / f;
                return res * (neg ? -1 : 1);
            }

            public boolean ready() {
                try {
                    return br.ready();
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
        }
    }