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

using System;

public class MatrixMultiplication
{
    //n??m ????????? A ??¨ m??l ????????? B ?????\??????????????????????????§?????? n??l ????????? C ???????????????
    static void Main(string[] args)
    {
        /*---??£?¨???¨---*/
        string[] buffer;
        int[] elementNum = new int[3];
        int highIndex;
        int widthIndex;
        int caluculationCount;
        long sum;
        /*---??£?¨???¨---*/

        /*????´???°???????????????????????¨???????¬???????????????????*/
        buffer = Console.ReadLine().Split(' ');
        elementNum[0] = int.Parse(buffer[0]);
        elementNum[1] = int.Parse(buffer[1]);
        elementNum[2] = int.Parse(buffer[2]);

        int[,] aMatrix = new int[elementNum[0], elementNum[1]];
        int[,] bMatrix = new int[elementNum[2], elementNum[1]];

        /*???????????????*/
        //A???????????????
        for(highIndex = 0; highIndex < elementNum[0]; highIndex++)
        {
            buffer = Console.ReadLine().Split(' ');
            for (widthIndex = 0; widthIndex < elementNum[1]; widthIndex++)
            {
                aMatrix[highIndex, widthIndex] = int.Parse(buffer[widthIndex]);
            }
        }
        //B???????????????
        for (highIndex = 0; highIndex < elementNum[1]; highIndex++)
        {
            buffer = Console.ReadLine().Split(' ');
            for (widthIndex = 0; widthIndex < elementNum[2]; widthIndex++)
            {
                bMatrix[widthIndex, highIndex] = int.Parse(buffer[widthIndex]);
            }
        }

        /*?¨????????????¨???*/
        for(highIndex = 0; highIndex < elementNum[0]; highIndex++)
        {
            for (caluculationCount = 0; caluculationCount < elementNum[2]; caluculationCount++)
            {
                sum = 0;
                for (widthIndex = 0; widthIndex < elementNum[1]; widthIndex++)
                {
                    sum += aMatrix[highIndex, widthIndex] * bMatrix[caluculationCount, widthIndex];
                }

                if (caluculationCount < (elementNum[2] - 1))
                    Console.Write("{0} ", sum);
                else
                    Console.WriteLine("{0}", sum);
            }
        }
    }
}