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: WA: Presentation Error)

using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;

namespace AizuOnline
{
    internal class Program
    {
        private static void Main(string[] args)
        {
            var x = Console.ReadLine().Split(' ');
            var p1 = int.Parse(x[0]);
            var p2 = int.Parse(x[1]);
            var p3 = int.Parse(x[2]);

            var A = new int[p1, p2];
            var B = new int[p2, p3];

            for (int i = 0; i < p1; i++)
            {
                var a = Console.ReadLine().Split(' ');
                for (int j = 0; j < a.Length; j++)
                {
                    A[i, j] = int.Parse(a[j]);
                }
            }

            for (int i = 0; i < p2; i++)
            {
                var a = Console.ReadLine().Split(' ');
                for (int j = 0; j < a.Length; j++)
                {
                    B[i, j] = int.Parse(a[j]);
                }
            }

            for (int i = 0; i < p1; i++)
            {
                for (int j = 0; j < p3; j++)
                {
                    Console.Write(A[i, 0] * B[0, j] + A[i, 1] * B[1, j]);

                    if (j != p3 - 1)
                    {
                        Console.Write(" ");
                    }
                }
                Console.WriteLine();
            }

            Console.WriteLine();
            Console.ReadLine();
        }
    }
}