import java.util.Scanner;
public class Main {
	public static void main(String[] args){
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		int m = scan.nextInt();
		int l = scan.nextInt();
		long[][] a = new long[n + 1][m + 1];
		long[][] b = new long[m + 1][l + 1];
		long[][] c = new long[n + 1][l + 1];
		int i,j,k;
		for(i = 1; i <= n; ++i){
			for(k = 1; k <= m; ++k){
				a[i][k] = scan.nextInt();
			}
		}
		for(k = 1; k <= m; ++k){
			for(j = 1; j <= l; ++j){
				b[k][j] = scan.nextInt();
			}
		}
		for(i = 1; i <= n; ++i){
			for(j = 1; j <= l; ++j){
				for(k = 1; k <= m; ++k){
					c[i][j] += a[i][k] * b[k][j] ;
				}
			}
				
			}
		for(i = 1; i <= n; ++i){
			for(j = 1; j <= l; ++j){
				if(j == l)
					System.out.println(c[i][j]);
				else 
					System.out.print(c[i][j]+" ");
			}
		}
		}
}
		
		
		


	
/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