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

        int[][] d1 = new int[n][m];
        int[][] d2 = new int[m][l];

        for(int i=0; i<n; i++) {
            for(int j=0; j<m; j++) {
                d1[i][j] = sc.nextInt();
            }
        }

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

        long[][] ans = new long[n][l];
        for(int i=0; i<n; i++) {            // height
            for(int k=0; k<l; k++) {        // width
                for(int j=0; j<m; j++) {    // content
                    ans[i][k] += d1[i][j]*d2[j][k];
                }
            }
        }

        for(int i=0; i<n; i++) {
            for(int j=0; j<l; j++) {
                if(j == l-1) {
                    System.out.println(ans[i][j]);
                } else {
                    System.out.print(ans[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