import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// 入力導入部
		Scanner sc = new Scanner(System.in);

		int n = sc.nextInt();
		int m = sc.nextInt();
		int l = sc.nextInt();

		// /////////////////////////////////////////////////////////////////
		// 計算部 x=n+n-i+n-l
		int[][] a, b;
		a = new int[n][m];
		b = new int[m][l];
		long[][] c = new long[n][l];

		for (int s = 0; s < n; s++) {
			for (int t = 0; t < m; t++) {
				a[s][t] = sc.nextInt();
			}
		}

		for (int s = 0; s < m; s++) {
			for (int t = 0; t < l; t++) {
				b[s][t] = sc.nextInt();
			}
		}
		sc.close();
		// ////配列Cを作成する
		long sum;
		for (int x = 0; x < n; x++) {
			for (int y = 0; y < l; y++) {
				sum = 0;
				for (int i = 0; i < m; i++) {
					sum += a[x][i] * b[i][y];
				}
				c[x][y] = sum;
			}
		}

		for (int i = 0; i < n; i++) {
			for (int s = 0; s < l; s++) {
				if (s == 0)
					System.out.print(c[i][s]);
				else
					System.out.print(" " + c[i][s]);
			}
			System.out.println();
		}
	}
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz