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 Go (judge verdict: Accepted)

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

// 行列の積
func main() {
	sc := bufio.NewScanner(os.Stdin)
	sc.Scan()
	nml := strings.Split(sc.Text(), " ")
	n, _ := strconv.Atoi(nml[0])
	m, _ := strconv.Atoi(nml[1])
	l, _ := strconv.Atoi(nml[2])
	A := make([][]string, n)
	B := make([][]string, m)
	for i := 0; i < n; i++ {
		sc.Scan()
		A[i] = make([]string, m)
		for j, v := range strings.Split(sc.Text(), " ") {
			A[i][j] = v
		}
	}
	for i := 0; i < m; i++ {
		sc.Scan()
		B[i] = make([]string, l)
		for j, v := range strings.Split(sc.Text(), " ") {
			B[i][j] = v
		}
	}

	C := make([][]int64, n)
	for i := 0; i < n; i++ {
		C[i] = make([]int64, l)
		for j := 0; j < l; j++ {
			for k := 0; k < m; k++ {
				v1 := parseInt64(A[i][k])
				v2 := parseInt64(B[k][j])
				C[i][j] += v1 * v2
			}
		}
	}

	for _, x := range C {
		fmt.Printf("%v\n", strings.Trim(fmt.Sprint(x), "[]"))
	}
}

func parseInt64(s string) int64 {
	v, _ := strconv.ParseInt(s, 10, 64)
	return v
}