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) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String[] ar = br.readLine().split(" ");
        int n = Integer.parseInt(ar[0]);
        int m = Integer.parseInt(ar[1]);
        int l = Integer.parseInt(ar[2]);
        int[][] a = new int[n][m];
        int[][] b = new int[m][l];
        for(int i = 0; i < a.length; i++){
            ar = br.readLine().split(" ");
            for(int j = 0; j <a[i].length; j++){
                a[i][j] = Integer.parseInt(ar[j]);
            }
        }
        for(int i = 0; i < b.length; i++){
            ar = br.readLine().split(" ");
            for(int j = 0; j <b[i].length; j++){
                b[i][j] = Integer.parseInt(ar[j]);
            }
        }
        for(int i = 0; i < n; i++){
            for(int j = 0; j < l; j++){
                long ans = 0;
                for(int k = 0; k < m; k++){
                    ans += a[i][k] * b[k][j];
                }
                if(j == l-1){
                    System.out.println(ans);
                }else{
                    System.out.print(ans+" ");
                }
            }
        }
    }
}