/*****************************************
备注：
******************************************/
#include <queue>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <iostream>
#include <vector>
#include <iomanip>
#include <string.h>
#include <algorithm>
using namespace std;
#define LL long long
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
int a[105][105];
int b[105][105];
int c[105][105];
int main()
{
	int n , m , p;
	cin >> n >> m;
	for(int i = 1 ; i <= n ; i++ )
		for(int j = 1; j <= m ; j++)
			cin >> a[i][j];
	cin >> p;
	for(int i = 1; i <= m ; i++)
		for(int j = 1; j <= p ; j++)
			cin >> b[i][j];
	for(int i = 1 ;i <= n ; i++)
	{
		for(int j = 1; j <= p ; j++)
		{
			for(int k = 1; k <= m ; k++)
				c[i][j] = c[i][j] + a[i][k] * b[k][j];
		}
	}
	for(int i = 1; i <= n ; i++)
	{
		for(int j = 1; j <= p ; j++)
			cout << c[i][j] << " ";
		cout << endl;
	}
	return 0;
}