import java.util.Scanner;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;

class Main {
    public static void main(String[] args) {
        int n, m, l;
        long sum;
        int[][] a;
        int[][] b;
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        m = sc.nextInt();
        l = sc.nextInt();
        a = new int[n][m];
        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();

        for (int i = 0; i < n; i++) {
        	for (int k = 0; k < l; k++) {
        		sum = 0;
	        	for (int j = 0; j < m; j++) {
    	    		sum += a[i][j] * b[j][k];
        		}
        		System.out.print(sum);
        		if (k != l - 1) 
        			System.out.print(" ");
        	}
        	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