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;
using System.Linq;

namespace ITP1_7_D
{
    class Program
    {
        static void Main(string[] args)
        {
            int[] x = Console.ReadLine().Split().Select(int.Parse).ToArray();
            int[,] a = new int[x[0],x[1]]; int[,] b = new int[x[1],x[2]];
            for (int i = 0; i < x[0]; i++)
            {
                int[] n = Console.ReadLine().Split().Select(int.Parse).ToArray();
                for (int j = 0; j < x[1]; j++)
                {
                    a[i,j] = n[j];
                }
            }
            for (int i = 0; i < x[1]; i++)
            {
                int[] n = Console.ReadLine().Split().Select(int.Parse).ToArray();
                for (int j = 0; j < x[2]; j++)
                {
                    b[i,j] = n[j];
                }
            }
            for (int i = 0; i < x[0]; i++)
            {
                long n = 0;
                for (int j = 0; j < x[2] - 1; j++)
                {
                    n = 0;
                    for (int k = 0; k < x[1]; k++)
                    {
                        n += a[i,k] * b[k,j];
                    }
                    Console.Write(n + " ");
                }
                n = 0;
                for (int k = 0; k < x[1]; k++)
                {
                    n += a[i,k] * b[k,x[2] - 1];
                }
                Console.WriteLine(n);
            }
        }
    }
}