#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(x,n) for(int i=x;i<n;i++)
#define REP(y,n) for(int j=y;j<n;j++)
#define vi vector<int>
#define vvi vector<vector<int>>
signed main(){
  int n,m,l,count=0;
  cin>>n>>m>>l;
  int A[n][m],B[m][l];
  rep(0,n)REP(0,m)cin>>A[i][j];
  rep(0,m)REP(0,l)cin>>B[i][j];
  rep(0,n){
    REP(0,l){
      for(int k=0;k<m;k++){
        count+=A[i][k]*B[k][j];
      }
      cout<<count;
      if(j!=l-1)cout<<' ';
      count=0;
    }
    cout<<endl;
  }
}


### 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<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(x,n) for(int i=x;i<n;i++)
#define REP(y,n) for(int j=y;j<n;j++)
#define vi vector<int>
#define vvi vector<vector<int>>
signed main(){
  int n,m,l,count=0;
  cin>>n>>m>>l;
  int A[n][m],B[m][l];
  rep(0,n)REP(0,m)cin>>A[i][j];
  rep(0,m)REP(0,l)cin>>B[i][j];
  rep(0,n){
    REP(0,l){
      for(int k=0;k<m;k++){
        count+=A[i][k]*B[k][j];
      }
      cout<<count;
      if(j!=l-1)cout<<' ';
      count=0;
    }
    cout<<endl;
  }
}


```