Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

Matrix Multiplication

Write a program which reads a $n \times m$ matrix $A$ and a $m \times l$ matrix $B$, and prints their product, a $n \times l$ matrix $C$. An element of matrix $C$ is obtained by the following formula:

\[
c_{ij} = \sum_{k=1}^m a_{ik}b_{kj}
\]

where $a_{ij}$, $b_{ij}$ and $c_{ij}$ are elements of $A$, $B$ and $C$ respectively.

Input

In the first line, three integers $n$, $m$ and $l$ are given separated by space characters

In the following lines, the $n \times m$ matrix $A$ and the $m \times l$ matrix $B$ are given.

Output

Print elements of the $n \times l$ matrix $C$ ($c_{ij}$). Print a single space character between adjacent elements.

Constraints

$1 \leq n, m, l \leq 100$

$0 \leq a_{ij}, b_{ij} \leq 10000$

Sample Input

3 2 3
1 2
0 3
4 5
1 2 1
0 3 2

Sample Output

1 8 5
0 9 6
4 23 14

Note

      解説

Solution in PHP (judge verdict: Time Limit Exceeded)

<?php
        // Input < n,m,l
        do
        {
                $input = preg_split('/ /', trim(fgets(STDIN)));
                if(3 != count($input))
                {
                        continue;
                }

                $n = $input[0];
                $m = $input[1];
                $l = $input[2];
                if( 1 <= $n and 100 > $n and
                    1 <= $m and 100 > $m and
                    1 <= $l and 100 > $l
                )
                {
                        break;
                }
        }while(1);

        // Input < A(n*m)
        $arrayA = array();
        for($loop_n = 0; $loop_n < $n;  $loop_n++)
        {
                $input = preg_split('/ /', trim(fgets(STDIN)));
                if($m == count($input))
                {
                        $arrayA[] = $input;
                }
                else
                {
                        $loop_n--;
                }
        }

        // Input < B(m*l)
        $arrayB = array();
        for($loop_m = 0; $loop_m < $m;  $loop_m++)
        {
                $input = preg_split('/ /', trim(fgets(STDIN)));
                if($l == count($input))
                {
                        $arrayB[] = $input;
                }
                else
                {
                        $loop_m--;
                }
        }

        // Output < C(n*l)
        for($i = 0; $i < $n; $i++)
        {
                $ans = array();
                for($j = 0; $j < $l; $j++)
                {
                        $c = 0;
                        for($k = 0; $k < $m; $k++)
                        {
                                $c = $c + $arrayA[$i][$k] * $arrayB[$k][$j];
                        }
                        $ans[] = $c;
                }
                echo implode(' ' , $ans) . "\n";
        }
?>