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.util.*;

public class Main {
	public static void main(String args[]) {
		Scanner scan = new Scanner(System.in);
		StringBuilder sb = new StringBuilder();
		int n, m, l, rs, c1, c2;
		n = scan.nextInt();
		m = scan.nextInt();
		l = scan.nextInt();
		rs = 0;// ?¨???????????????????????????????
		c1 = 0;// ????¬???????????????????
		c2 = 0;// ????¬???????????????????

		// ????¬???????????????¨???
		int num1[][] = new int[n + 5][m + 5];
		int num2[][] = new int[m + 5][l + 5];
		int result[][] = new int[n + 5][l + 5];

		// ????¬???????????????\??? num1
		for (int count = 0; count < n; count++) {
			for (int count2 = 0; count2 < m; count2++) {
				num1[count][count2] = scan.nextInt();
			}
		}
		// ????¬???????????????\??? num2
		for (int count3 = 0; count3 < m; count3++) {
			for (int count4 = 0; count4 < l; count4++) {
				num2[count3][count4] = scan.nextInt();
			}
		}

		// ?¨???? (n*m)?????°????????????
		// l??????????????????????????????
		for (int count7 = 0; count7 < l; count7++) {
			for (int count5 = 0; count5 < n; count5++) {
				for (int count6 = 0; count6 < m; count6++) {
					rs = rs + num1[count5][count6] * num2[count6][c2];
				}
				result[c1][c2] = rs;
				c1++;
				rs = 0;
			}

			c1 = 0;
			c2++;
		}

		// output (n*m)?????????
		for (int i = 0; i < n; i++) {
			for (int i2 = 0; i2 < l; i2++) {
				sb.append(result[i][i2]);
				if (i2 != (l - 1)) {
					sb.append(" ");
				}
			}
			sb.append("\n");
		}

		System.out.print(new String(sb));

	}
}