Q

#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <algorithm>

using namespace std;

vector<vector<int> > mul(vector<vector<int> > a, vector<vector<int> > b) {
	vector<vector<int> > c(a.size(), vector<int>(b[0].size(), 0));
	for (int i = 0; i < a.size(); i++) {
		for (int j = 0; j < b[0].size(); j++) {
			for (int k = 0; k < b.size(); k++) {
				c[i][j] += a[i][k] * b[k][j];
			}
		}
	}
	return c;
}

void print(vector<vector<int> > a) {
	for (int i = 0; i < a.size(); i++) {
		for (int j = 0; j < a[i].size(); j++) {
			cout << a[i][j] << ' ';
		}
		cout << endl;
	}
}


int main() {
	int p, q, r;
	cin >> p >> q >> r;
	vector<vector<int> > a(p, vector<int>(q));
	for (int i = 0; i < p; i++) {
		for (int j = 0; j < q; j++) {
			cin >> a[i][j];
		}
	}

	vector<vector<int> > b(q, vector<int>(r));
	for (int i = 0; i < q; i++){
		for (int j = 0; j < r; j++) {
			cin >> b[i][j];
		}
	}

	print(mul(a, b));
	return 0;
}