题解 | #矩阵乘法#

import java.util.*;

public class Main {
    public static void main(String [] args) {
        Scanner sc = new Scanner(System.in);
        
        while (sc.hasNext()) {
            int x = sc.nextInt();
            int y = sc.nextInt();
            int z = sc.nextInt();
            int[][]  one = new int[x][y];
            int[][]  two = new int[y][z];
            int[][]  result = new int[x][z];
            
            for (int i=0; i<x; i++) {
                for (int j=0; j<y; j++) {
                    one[i][j] = sc.nextInt();
                }
            }
            for (int i=0; i<y; i++) {
                for (int j=0; j<z; j++) {
                    two[i][j] = sc.nextInt();
                }
            }
            
            for (int i=0; i<x; i++) { // 行
                for (int j=0; j<z; j++) { // 列
                    int sum = 0;
                    for (int k=0; k<y; k++) {
                        sum += one[i][k]*two[k][j];
                    }
                    result[i][j] = sum;
                }
            }
            
            for (int i=0; i<x; i++) {
                for (int j=0; j<z; j++) {
                    System.out.print(result[i][j] + " ");
                }
                System.out.println();
            }
        }
    }
}