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][m];
        long [] [] b = new long[m][l];
        long [] [] c = new long[n][l];
        for(int x = 0; x < n; x++){
            for(int y = 0; y < m; y++){
                a[x] [y] = scan.nextInt();
            }
        }
        for(int x = 0; x < m; x++){
            for(int y = 0; y < l; y++){
                b[x] [y] = scan.nextInt();
            }
        }
        for(int x =0; x < n; x++){
            for(int y = 0; y < l; y++){
                for(int r = 0; r < m; r++){
                    c[x][y] = c[x][y] + (a[x][r] * b[r][y]);
                }
            }
        }
        for(int x = 0; x < n; x++){
            for(int y = 0; y < l; y++){
                if(y != l-1) {
                    System.out.print(c[x][y] + " ");
                }
                else{
                    System.out.print(c[x][y]);
                }
            }
            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