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.IOException;
import java.io.InputStreamReader;

public class Main {
	public static void main(String[] args) {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		
		int[][] ma;
		int[][] mb;
		
		String x = "";
		try {
			x = in.readLine();
			String[] data = x.split(" ");
			int n = Integer.parseInt(data[0]);
			int m = Integer.parseInt(data[1]);
			int l = Integer.parseInt(data[2]);
			
			ma = new int[n][m];
			mb = new int[m][l];

			for (int i = 0; i < n; i++) {
				x = in.readLine();
				data = x.split(" ");
				
				for (int j = 0; j < m; j++) {
					ma[i][j] = Integer.parseInt(data[j]);
				}
			}
			
			for (int i = 0; i < m; i++) {
				x = in.readLine();
				data = x.split(" ");
				
				for (int j = 0; j < l; j++) {
					mb[i][j] = Integer.parseInt(data[j]);
				}
			}
			
			long[][] mc = new long[n][l];
			for (int i = 0; i < n; i++) {
				for (int j = 0; j < l; j++) {
					mc[i][j] = 0;
					for (int k = 0; k < m; k++) {
						mc[i][j] = mc[i][j] + ma[i][k] * mb[k][j];
					}
				}
			}

			for (int i = 0; i < n; i++) {
				for (int j = 0; j < l; j++) {
					if (j != 0) System.out.print(" ");
					System.out.print(mc[i][j]);
				}
				System.out.println();
			}
		} catch (NumberFormatException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
}