import java.util.Scanner;

public class Main {
	void run() {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		int m = scan.nextInt();
		int l = scan.nextInt();
		long[][] a = new long[n][];
		for (int i = 0; i < n; i++) {
			a[i] = new long[m];
			for (int j = 0; j < m; j++) {
				a[i][j] = scan.nextInt();
			}
		}
		long[][] b = new long[m][];
		for (int i = 0; i < m; i++) {
			b[i] = new long[l];
			for (int j = 0; j < l; j++) {
				b[i][j] = scan.nextInt();
			}
		}
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < l; j++) {
				long c = 0;
				for (int k = 0; k < m; k++) {
					c += a[i][k] * b[k][j];
				}
				if (j == 0) {
					System.out.print(c);
				} else System.out.print(" " + c);
			}
			System.out.println();
		}
	}
	public static void main(String[] args) {
		new Main().run();
	}
}
/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