import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		int m = scanner.nextInt();
		int l = scanner.nextInt();
		int[][] A = new int[n][m];
		int[][] B = new int[m][l];
		long[][] C = new long[n][l];
		for(int i=0;i<n;i++) {
			for(int j=0;j<m;j++) {
				A[i][j] = scanner.nextInt(); 
			}
		}
		for(int i=0;i<m;i++) {
			for(int j=0;j<l;j++) {
				B[i][j] = scanner.nextInt(); 
			}
		}
		
		for(int i=0;i<n;i++) {
			for(int j=0;j<l;j++) {
				long temp = 0;
				for(int k=0;k<m;k++) {
					temp += A[i][k]*B[k][j];
				}
				C[i][j] = temp;
				if (j!=l-1) {
					System.out.print(C[i][j] + " ");
				}else {
					System.out.print(C[i][j]);
				}
			}
			System.out.println();
		}
		scanner.close();
		
	}
}

/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