#include "bits/stdc++.h"

using ll = long long;

using namespace std;

// 0 -> a-1
#define rep(i, a) for (int i = 0; (i) < (int)(a); (i)++)
// a -> b-1
#define reps(i, a, b) for (int i = (int)(a); (i) < (int)(b); (i)++)
// a-1 -> 0
#define rrep(i, a) for (int i = (int)a - 1; (i) >= 0; (i)--)
// a-1 -> b
#define rreps(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b); (i)--)
#define MP(a, b) make_pair((a), (b))
#define PB(a) push_back((a))
#define all(v) (v).begin(), (v).end()
// next_permutation(all(v))
#define PERM(v) next_permutation(all(v))
/*sort(all(v));
(v).erase(unique(all(v)), v.end())*/
#define UNIQUE(v)                                                              \
	sort(all(v));                                                              \
	(v).erase(unique(all(v)), v.end())
#define CIN(type, x)                                                           \
	type x;                                                                    \
	cin >> x
#define YES(f)                                                                 \
	if ((f)) {                                                                 \
		cout << "YES" << endl;                                                 \
	} else {                                                                   \
		cout << "NO" << endl;                                                  \
	}
#define Yes(f)                                                                 \
	if ((f)) {                                                                 \
		cout << "Yes" << endl;                                                 \
	} else {                                                                   \
		cout << "No" << endl;                                                  \
	}
#define MINV(v) min_element(all(v))
#define MAXV(v) max_element(all(v))
#define MIN3(a, b, c) min(min(a, b), c)
#define MIN4(a, b, c, d) min(MIN3(a, b, c), d)
#define MIN5(a, b, c, d, e) min(MIN4(a, b, c, d), e)
#define MIN6(a, b, c, d, e, f) min(MIN5(a, b, c, d, e), f)
#define MAX3(a, b, c) max(max(a, b), c)
#define MAX4(a, b, c, d) max(MAX3(a, b, c), d)
#define MAX5(a, b, c, d, e) max(MAX4(a, b, c, d), e)
#define MAX6(a, b, c, d, e, f) max(MAX5(a, b, c, d, e), f)
// b is [a, c)
#define RANGE(a, b, c) ((a) <= (b) && (b) < (c))
// c is [a, e) && d is [b, f)
#define RANGE2D(a, b, c, d, e, f) (RANGE((a), (c), (e)) && RANGE((b), (d), (f)))
#define chmin(a, b) a = min(a, (b))
#define chmin3(a, b, c) a = MIN3(a, (b), (c))
#define chmin4(a, b, c, d) a = MIN4(a, (b), (c), (d))
#define chmin5(a, b, c, d, e) a = MIN5(a, (b), (c), (d), (e))
#define chmin6(a, b, c, d, e, f) a = MIN6(a, (b), (c), (d), (e), (f))
#define chmax(a, b) a = max(a, (b))
#define chmax3(a, b, c) a = MAX3(a, (b), (c))
#define chmax4(a, b, c, d) a = MAX4(a, (b), (c), (d))
#define chmax5(a, b, c, d, e) a = MAX5(a, (b), (c), (d), (e))
#define chmax6(a, b, c, d, e, f) a = MAX6(a, (b), (c), (d), (e), (f))
#define fcout cout << fixed << setprecision(12)

template <class T>
struct Matrix {
	int row;
	int column;
	vector<vector<T>> v;
	vector<T> &operator[](int i) { return (v[i]); }
	Matrix(int i, int j) {init(i, j);}
	Matrix() : Matrix(0, 0) {}
	void init(int i, int j) {
		row = i;
		column = j;
		v.resize(i, vector<T>(j, 0));
	}
	Matrix(const Matrix &cp) {
		row = cp.row;
		column = cp.column;
		v = cp.v;
	}
	~Matrix() {}
	Matrix operator=(const Matrix &a) {
		row = a.row;
		column = a.column;
		v = a.v;
		return (*this);
	}
	Matrix operator+(const Matrix &a) {
		Matrix r(row, column);
		for (int i = 0; i < row; i++) {
			for (int j = 0; j < column; j++) {
				r.v[i][j] = v[i][j] + a.v[i][j];
			}
		}
		return (r);
	}
	Matrix operator-(const Matrix &a) {
		Matrix r(row, column);
		for (int i = 0; i < row; i++) {
			for (int j = 0; j < column; j++) {
				r.v[i][j] = v[i][j] - a.v[i][j];
			}
		}
		return (r);
	}
	Matrix operator*(const Matrix &a)
	{
		Matrix r(row, a.column);
		for (int i = 0; i < row; i++) {
			for (int j = 0; j < a.column; j++) {
				for (int k = 0; k < column; k++) {
					r.v[i][j] += v[i][k] * a.v[k][j];
				}
			}
		}
		return (r);
	}
	Matrix operator*(const int b) {
		Matrix r(row, column);
		for (int i = 0; i < row; i++) {
			for (int j = 0; j < column; j++) {
				r.v[i][j] = b * v[i][j];
			}
		}
		return (r);
	}
	Matrix operator+(const int b) {
		Matrix r(row, column);
		for (int i = 0; i < row; i++) {
			for (int j = 0; j < column; j++) {
				r.v[i][j] = b + v[i][j];
			}
		}
		return (r);
	}
	Matrix operator-(const int b) {
		Matrix r(row, column);
		for (int i = 0; i < row; i++) {
			for (int j = 0; j < column; j++) {
				r.v[i][j] = v[i][j] - b;
			}
		}
		return (r);
	}
	void unit_matrix() {
		int n = row;
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				v[i][j] = (i == j);
			}
		}
	}
	Matrix<T> accumu_sum() {
		Matrix<T> r(row+1, column+1);
		for (int i = 1; i <= row; i++) {
			for (int j = 1; j <= column; j++) {
				r[i][j] = v[i-1][j-1] + r[i-1][j] + r[i][j-1] - r[i-1][j-1];
			}
		}
		return (r);
	}
	//半開区間で指定
	T get_sum_accumu(int r1, int c1, int r2, int c2) {
		return v[r2][c2] + v[r1][c1] - v[r2][c1] - v[r1][c2];
	}
	Matrix transposed() {
		Matrix t(column, row);
		for (int i = 0; i < row; i++) {
			for (int j = 0; j < column; j++) {
				t[j][i] = v[i][j];
			}
		}
		return (t);
	}
	friend ostream &operator<<(ostream &lhs, const Matrix<T> &rhs) {
		for (int i = 0; i < rhs.row; i++) {
			for (int j = 0; j < rhs.column - 1; j++) {
				lhs << rhs.v[i][j] << " ";
			}
			lhs << rhs.v[i][rhs.column - 1];
			if (i != rhs.row-1) cout << endl;
		}
		return lhs;
	}
	friend istream &operator>>(istream &lhs, Matrix<T> &rhs) {
		for (int i = 0; i < rhs.row; i++) {
			for (int j = 0; j < rhs.column; j++) {
				lhs >> rhs.v[i][j];
			}
		}
		return lhs;
	}
};

int main()
{
	int n, m, l;
	cin >> n >> m >> l;
	Matrix<long long> A(n, m);
	Matrix<long long> B(m, l);
	cin >> A >> B;
	auto C = A * B;
	cout << C << endl;
}



Measured memory_bytes: 3352