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.Scanner;

public class Main {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);

		String line1 = sc.nextLine();
		String[] string1 = line1.split(" ");
		int n = Integer.parseInt(string1[0]);
		int m = Integer.parseInt(string1[1]);
		int l = Integer.parseInt(string1[2]);

		String[][] gyouA = new String[n][m];
		int[][] A = new int[n][m];
		for (int i = 0; i < n; i++) {
			String line2 = sc.nextLine();
			for (int j = 0; j < m; j++) {
				String[] string = line2.split(" ");
				gyouA[i][j] = string[j];
				A[i][j] = Integer.parseInt(gyouA[i][j]);
			}

		}

		String[][] gyouB = new String[m][l];
		int[][] B = new int[m][l];
		for (int i = 0; i < m; i++) {
			String line3 = sc.nextLine();
			for (int j = 0; j < l; j++) {
				String[] string = line3.split(" ");
				gyouB[i][j] = string[j];
				B[i][j] = Integer.parseInt(gyouB[i][j]);
			}

		}

		int AB = 0;
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < l; j++) {
				int C = 0;
				for (int k = 0; k < m; k++) {
					AB = A[i][k] * B[k][j];
					C += AB;
					if (A[i][k] > 10000 || B[k][j] > 10000) {
						System.out.println("Too Large");
						break;
					}
				}
				if (j == l - 1) {
					System.out.print(C);

				} else {
					System.out.print(C + " ");

				}
			}
			System.out.println();
		}
	}
}