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 C# (judge verdict: Wrong Answer)

using System;

namespace ITP1_7_D
{
    class Program
    {
        static void Main(string[] args)
        {
            string[] strs = Console.ReadLine().Split(' ');
            int n = int.Parse(strs[0]);
            int m = int.Parse(strs[1]);
            int l = int.Parse(strs[2]);
            int[,] a = ReadMatrix(n, m);
            int[,] b = ReadMatrix(m, l);
            for (int i = 0; i < n; i++)
            {
                for (int j = 0; j < l; j++)
                {
                    int sum = 0;
                    for (int k = 0; k < m; k++) sum += a[i, k] * b[k, j];
                    Console.Write(sum);
                    if (j < l - 1) Console.Write(" ");
                }
                Console.WriteLine();
            }
        }

        static int[,] ReadMatrix(int r, int c)
        {
            int[,] m = new int[r, c];
            for (int i = 0; i < r; i++)
            {
                string[] strs = Console.ReadLine().Split(' ');
                for (int j = 0; j < c; j++) m[i, j] = int.Parse(strs[j]);
            }
            return m;
        }
    }
}