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.Collections.Generic;
using System.Linq;
using System.Text;
using System.IO;


namespace StartFinish
{

    class Program
    {
        static void Main(string[] args)
        {
            //???????????????
            long[] nml = Console.ReadLine().Split(' ').Select(long.Parse).ToArray();
            long n = nml[0];
            long m = nml[1];
            long l = nml[2];
            long[][] graph1 = new long[n][];
            for(long i = 0; i < n; i++)
            {
                graph1[i] = Console.ReadLine().Split(' ').Select(long.Parse).ToArray();
            }
            long[][] graph2 = new long[m][];
            for(long i = 0; i < m; i++)
            {
                graph2[i] = Console.ReadLine().Split(' ').Select(long.Parse).ToArray();
            }

            long[,] graph3 = new long[n, l];

            //?¨??????????
            for(long i = 0; i < n; i++)
            {
                for(long k = 0; k < l; k++)
                {
                    for(long j = 0; j < m; j++)
                    {
                        graph3[i, k] += graph1[i][j] * graph2[j][k];
                    }
                }
            }

            //????????¨
            for(long i = 0; i < n; i++)
            {
                for(long j = 0; j < l; j++)
                {
                    if (j == l - 1)
                    {
                        Console.WriteLine(graph3[i, j]);
                    }
                    else
                    {
                        Console.Write("{0} ", graph3[i, j]);
                    }
                }
            }

        }
    }
}