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

class Main{
    public static void main(String args[])throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String[] ss = br.readLine().split(" ");
        
        int n = Integer.parseInt(ss[0]);
        int m = Integer.parseInt(ss[1]);
        int l = Integer.parseInt(ss[2]);
        int count=0;
        if(!(n<1 || m<1 || l<1 || n>100 || m>100 || l>100)){
            int num1[][] = new int[n][m];
            int num2[][] = new int[m][l];
        
            for(int i=0; i<n; i++){
                String[] s = br.readLine().split(" ");
        	   for(int j=0; j<m; j++){
                    num1[i][j] = Integer.parseInt(s[j]);
        	   }
            }
            for(int i=0; i<m; i++){
        	   String[] str = br.readLine().split(" ");
        	   for(int j=0; j<l; j++){
        		  num2[i][j] = Integer.parseInt(str[j]);
        	   }
            }
            for(int i=0; i<n; i++){
        	   for(int j=0; j<l; j++){
                    int a=0;
        		    for(int k=0; k<m; k++){
        			     a += num1[i][k] * num2[k][j];
        		    }
        		    System.out.print(a);
                    if(count<l-1){
                        System.out.print(" ");
                        count++;
                    }
        	   }
        	   System.out.println("");
               count=0;
            }
        }
    }
}