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: Accepted)

import java.io.BufferedReader;
import java.io.InputStreamReader;

public class Main {

	public static void main(String[] args) {
		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		String buffer;

		int count = 0;
		int m = 0;
		int n = 0;
		int l = 0;
		int[][] matrix1 = null;
		int[][] matrix2 = null;
		try {
			while ((buffer = reader.readLine())  != null) {
				String[] input = buffer.split(" ");

				if (count == 0) {
					n = Integer.valueOf(input[0]);
					m = Integer.valueOf(input[1]);
					l = Integer.valueOf(input[2]);
					matrix1 = new int[n][m];
					matrix2 = new int[m][l];
				}
				else if (count <= n) {
					for (int i = 0; i < m; i++) {
						matrix1[count - 1][i] = Integer.valueOf(input[i]);
					}
				}
				else if (count <= n + m) {
					for (int i = 0; i < l; i++) {
						matrix2[count - 1 - n][i] = Integer.valueOf(input[i]);
					}
				}
				if (count == n + m) {
					for (int h = 0; h < n; h++) {
						for (int w = 0; w < l; w++) {
							long calc = 0;
							for (int i = 0; i < m; i++) {
								calc += matrix1[h][i] * matrix2[i][w];
							}
							System.out.print(calc);
							if (w != l - 1) {
								System.out.print(" ");
							}
							else {
								System.out.println();
							}
						}
					}
					//output
					reader.close();
					return;
				}

				count++;
			}
		} catch (Exception ex) {
			ex.printStackTrace();
		}
	}
}