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();

		long[][] A = new long[n][m];
		long[][] B = new long[m][l];

		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				A[i][j] = sc.nextLong();
			}
		}
		for (int j = 0; j < m; j++) {
			for (int k = 0; k < l; k++) {
				B[j][k] = sc.nextLong();
			}
		}

		long[][] sum = new long[n][l];

		for (int p = 0; p < n; p++) {
			for (int q = 0; q < l; q++) {
				sum[p][q] = 0;
				for (int k = 0; k < m; k++) {
					sum[p][q] = sum[p][q] + A[p][k] * B[k][q];
				}
				if (q != l - 1) {
					System.out.print(sum[p][q] + " ");
				} else {
					System.out.print(sum[p][q]);
				}
			}
			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