#include <iostream>
int main() {
    int n,m,l;
    scanf("%d%d%d", &n, &m, &l);
    long a[n][m], b[m][l];
    for (int i=0; i<n; i++) for (int j=0; j<m; j++) scanf("%ld", &a[i][j]);
    for (int i=0; i<m; i++) for (int j=0; j<l; j++) scanf("%ld", &b[i][j]);
    for (int i=0; i<n; i++) for (int j=0; j<l; j++) {
        long s=0;
        for (int k=0; k<m; k++) {
            s += a[i][k] * b[k][j];
        }
        printf("%ld", s);
        if (j < l - 1) printf(" ");
        else printf("\n");
    }
    return 0;
}
### Prompt

Please provide a Cpp coded solution to the problem described below:

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.

Note

解説

Constraints

* $1 \leq n, m, l \leq 100$
* $0 \leq a_{ij}, b_{ij} \leq 10000$

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.

Example

Input

3 2 3
1 2
0 3
4 5
1 2 1
0 3 2


Output

1 8 5
0 9 6
4 23 14

### Response

```cpp
#include <iostream>
int main() {
    int n,m,l;
    scanf("%d%d%d", &n, &m, &l);
    long a[n][m], b[m][l];
    for (int i=0; i<n; i++) for (int j=0; j<m; j++) scanf("%ld", &a[i][j]);
    for (int i=0; i<m; i++) for (int j=0; j<l; j++) scanf("%ld", &b[i][j]);
    for (int i=0; i<n; i++) for (int j=0; j<l; j++) {
        long s=0;
        for (int k=0; k<m; k++) {
            s += a[i][k] * b[k][j];
        }
        printf("%ld", s);
        if (j < l - 1) printf(" ");
        else printf("\n");
    }
    return 0;
}
```