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;

class Program
{
    static void Main(string[] args)
    {
        string str = Console.ReadLine();
        string[] strer = new string[3];
        strer = str.Split(' ');

        int n = int.Parse(strer[0]);
        int m = int.Parse(strer[1]);
        int l = int.Parse(strer[2]);

        long[,] array1 = new long[n,m];
        string[] array1_str = new string[m];

       
        for (int i = 0; i < n; i++)
        {
            str = Console.ReadLine();
            array1_str = str.Split(' ');

            for (int j = 0; j < m; j++)
            {
                array1[i, j] = int.Parse(array1_str[j]);
            }
        }

        long[,] array2 = new long[m, l];
        string[] array2_str = new string[l];

       
        for (int i = 0; i < m; i++)
        {
            str = Console.ReadLine();
            array2_str = str.Split(' ');

            for (int j = 0; j < l; j++)
            {
                array2[i, j] = int.Parse(array2_str[j]);
            }
        }

        long[,] result = new long[n, l];
        
       
        for (int i = 0; i < n; i++)
        {          
            for (int j = 0; j < l; j++)
            {
                for (int k = 0; k < m; k++)
                {
                    result[i, j] += array1[i, k] * array2[k, j];
                }
              
            }
        }

        
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < l; j++)
            {
                if (j == l - 1)
                {
                    Console.Write(result[i, j]);
                }
                else
                {
                    Console.Write(result[i, j] + " ");
                }
            }
            Console.WriteLine();
        }



    }
}