import java.util.Scanner;
class Main {
    int n,m,l;
    public void solve(){
        Scanner sc = new Scanner(System.in);
        sc.useDelimiter("\\s");
        n = sc.nextInt();
        m = sc.nextInt();
        l = sc.nextInt();
        int [][] a = new int [n+1][m+1];
        int [][] b = new int [m+1][l+1];
        long [][] c = new long [n+1][l+1];
        for(int x = 0; x < n; x++){
            for(int y = 0; y < m; y++){
                a[x][y] = sc.nextInt();
            }
        }
        for(int x = 0; x < m; x++){
            for(int y = 0; y < l; y++){
                b[x][y] = sc.nextInt();
            }
        }
        for(int x = 0; x < n; x++){
            for(int y = 0; y < l; y++){
                c[x][y] = 0;
            }
        }
        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];
                }
                if(y==l-1){
                    System.out.printf("%d",c[x][y]);
                    System.out.println();
                }else{
                    System.out.printf("%d ",c[x][y]);
                }
            }
        }
    }
    public static void main(String[] args){
        new Main().solve();
    }
}
/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