import java.util.Scanner;
class Main {

	public static void main(String[] args) {
		try (Scanner sc = new Scanner (System.in)){
			int n = sc.nextInt();
			int m = sc.nextInt();
			int l = sc.nextInt();

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

			//読み込む----------------------------
			for (int i=0; i<n; i++) {
				for (int j=0; j<m; j++) {
					A[i][j] = sc.nextInt();
				}
			}

			for (int i=0; i<m; i++) {
				for (int j=0; j<l; j++) {
					B[i][j] = sc.nextInt();
				}
			}
			//-------------------------------------

			long[][] C = new long[n][l];
			for (int i=0; i<n; i++) {
				for (int j=0; j<l; j++) {
					for (int k=0; k<m; k++) {
						C[i][j] += A[i][k] * B[k][j];
					}
				}
			}

            for (int i=0; i<n; i++) {
				for (int j=0; j<l; j++) {
					System.out.print(C[i][j]);
					if (j!= l-1) System.out.print(" ");
				}
				System.out.print('\n');
			}
		}
	}
}


/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