#include<iostream>
#include<algorithm>
#include<vector>

#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;

using namespace std;

const int INF = 100;

int main()
{

	int n, m, l;

	cin >> n >> m >> l;

	int A[200][200];
	rep(i, n)rep(j, m)cin >> A[i][j];

	int B[200][200];
	rep(i, m)rep(j, l)cin >> B[i][j];

	rep(i, n) {
		rep(j, l) {
			ll out = 0;
			rep(k, m) {
				out += A[i][k] * B[k][j];
			}
			if (j == 0) {
				cout << out;
			}
			else {
				cout << " " << out;
			}
		}
		cout << endl;
	}

	return 0;
}


### Prompt

Create a solution in Cpp for the following problem:

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>
#include<algorithm>
#include<vector>

#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;

using namespace std;

const int INF = 100;

int main()
{

	int n, m, l;

	cin >> n >> m >> l;

	int A[200][200];
	rep(i, n)rep(j, m)cin >> A[i][j];

	int B[200][200];
	rep(i, m)rep(j, l)cin >> B[i][j];

	rep(i, n) {
		rep(j, l) {
			ll out = 0;
			rep(k, m) {
				out += A[i][k] * B[k][j];
			}
			if (j == 0) {
				cout << out;
			}
			else {
				cout << " " << out;
			}
		}
		cout << endl;
	}

	return 0;
}


```