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 JAVA (judge verdict: Wrong Answer)

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.lang.StringBuilder;
public class Main {
	public static void main(String[] args) throws Exception{
		BufferedReader sc = new BufferedReader(new InputStreamReader(System.in));
		StringBuilder sb = new StringBuilder();
		String[] st = sc.readLine().split(" ");
		int n = Integer.parseInt(st[0]);
		int m = Integer.parseInt(st[1]);
		int l = Integer.parseInt(st[2]);
		int[][] a = new int[n][m];
		int[][] b = new int[m][l];
		int t = 0;
		for(int i = 0;i < n;i++){
			st = sc.readLine().split(" ");
			for(int k = 0;k < m;k++){
				a[i][k] = Integer.parseInt(st[k]);
			}
		}
		for(int i = 0;i < m;i++){
			st = sc.readLine().split(" ");
			for(int k = 0;k < l;k++){
				b[i][k] = Integer.parseInt(st[k]);
			}
		}
		for(int i = 0;i < n;i++){
			for(int k = 0;k < l;k++){
				for(int j = 0;j < m;j++){
					t += a[i][j]*b[j][k];
				}
				sb.append(t);
				t = 0;
				if(k!=l-1)
					sb.append(" ");
			}
			sb.append("\n");
		}
		System.out.print(sb);
	}
}