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: Wrong Answer)

using System;
using System.Linq;

namespace ITP1_7_D
{
    class Program
    {
        static void Main(string[] args)
        {
            int[] size = Console.ReadLine().Split(' ').Select(x => Convert.ToInt32(x)).ToArray();
            foreach(var s in size)
            {
                if (s < 1 || 100 < s)
                {
                    Console.WriteLine("Too Large");
                    Environment.Exit(0);
                }
            }               
            int n = size[0];
            int m = size[1];
            int l = size[2];          
            int[,] vectorA = new int[n, m];
            int[,] vectorB = new int[m, l];
            int[,] vectorC = new int[n, l];
            int maxresult = n * m * 10000;
            
            MyVector.SetVector(n, m, vectorA, (x => 0 <= x));
            MyVector.SetVector(m, l, vectorB, (x => x <= 10000));

            for (int i = 0; i < n; i++)
                for (int j = 0; j < l; j++)
                    for (int k = 0; k < m; k++)
                    {
                        vectorC[i, j] += vectorA[i, k] * vectorB[k, j];
                        if(maxresult < vectorC[i, j])
                        {
                            Console.WriteLine("Too Large");
                            Environment.Exit(0);
                        }
                    }
                        
            MyVector.ShowVector(n, l, vectorC);
        }
    }
    class MyVector
    {
        static public void SetVector(int a,int b,int[,] data, Func<int,bool> f)
        {
            for (int i=0;i< a; i++)
            {
                int[] input = Console.ReadLine().Split(' ').Select(x => Convert.ToInt32(x)).ToArray();
                for (int j = 0; j < b; j++)
                {
                    if (f(input[j])) data[i, j] = input[j];
                    else {
                        Console.WriteLine("Too Large");
                        Environment.Exit(0);
                    }
                }                   
            }
        }
        static public void ShowVector(int a,int b,int[,] data)
        {
            for (int i = 0; i < a; i++)
            {
                string s;
                for (int j = 0; j < b; j++)
                {
                    Console.Write(data[i, j]);
                    s = j == (b - 1) ? "\n" : " ";
                    Console.Write(s);
                }
            }
        }
    }
}