import java.util.*;

class Main {
        public static void main(String args[]) {
                try (Scanner sc = new Scanner(System.in)) {
                        int n = sc.nextInt(), m = sc.nextInt(), l = sc.nextInt();
                        long[][] A = new long[n][m];
                        long[][] B = new long[m][l];
                        for (int i = 0; i < n; i++) {
                                for (int j = 0; j < m; j++) {
                                        A[i][j] = sc.nextLong();
                                }
                        }
                        for (int i = 0; i < m; i++) {
                                for (int j = 0; j < l; j++) {
                                        B[i][j] = sc.nextLong();
                                }
                        }
                        for (int i = 0; i < n; i++) {
                                for (int j = 0; j < l; j++) {
                                        long num = 0;
                                        for (int k = 0; k < m; k++) {
                                                num += A[i][k] * B[k][j];
                                        }
                                        System.out.print(num);
                                        if (j != l - 1) {
                                                System.out.print(" ");
                                        } else {
                                                System.out.print("\n");
                                        }
                                }
                        }
                }
        }
} import java.util.*; util.* java class Main {
        public static void main(String args[]) {
                try (Scanner sc = new Scanner(System.in)) {
                        int n = sc.nextInt(), m = sc.nextInt(), l = sc.nextInt();
                        long[][] A = new long[n][m];
                        long[][] B = new long[m][l];
                        for (int i = 0; i < n; i++) {
                                for (int j = 0; j < m; j++) {
                                        A[i][j] = sc.nextLong();
                                }
                        }
                        for (int i = 0; i < m; i++) {
                                for (int j = 0; j < l; j++) {
                                        B[i][j] = sc.nextLong();
                                }
                        }
                        for (int i = 0; i < n; i++) {
                                for (int j = 0; j < l; j++) {
                                        long num = 0;
                                        for (int k = 0; k < m; k++) {
                                                num += A[i][k] * B[k][j];
                                        }
                                        System.out.print(num);
                                        if (j != l - 1) {
                                                System.out.print(" ");
                                        } else {
                                                System.out.print("\n");
                                        }
                                }
                        }
                }
        }
} Main public static void main(String args[]) {
                try (Scanner sc = new Scanner(System.in)) {
                        int n = sc.nextInt(), m = sc.nextInt(), l = sc.nextInt();
                        long[][] A = new long[n][m];
                        long[][] B = new long[m][l];
                        for (int i = 0; i < n; i++) {
                                for (int j = 0; j < m; j++) {
                                        A[i][j] = sc.nextLong();
                                }
                        }
                        for (int i = 0; i < m; i++) {
                                for (int j = 0; j < l; j++) {
                                        B[i][j] = sc.nextLong();
                                }
                        }
                        for (int i = 0; i < n; i++) {
                                for (int j = 0; j < l; j++) {
                                        long num = 0;
                                        for (int k = 0; k < m; k++) {
                                                num += A[i][k] * B[k][j];
                                        }
                                        System.out.print(num);
                                        if (j != l - 1) {
                                                System.out.print(" ");
                                        } else {
                                                System.out.print("\n");
                                        }
                                }
                        }
                }
        } main {
                try (Scanner sc = new Scanner(System.in)) {
                        int n = sc.nextInt(), m = sc.nextInt(), l = sc.nextInt();
                        long[][] A = new long[n][m];
                        long[][] B = new long[m][l];
                        for (int i = 0; i < n; i++) {
                                for (int j = 0; j < m; j++) {
                                        A[i][j] = sc.nextLong();
                                }
                        }
                        for (int i = 0; i < m; i++) {
                                for (int j = 0; j < l; j++) {
                                        B[i][j] = sc.nextLong();
                                }
                        }
                        for (int i = 0; i < n; i++) {
                                for (int j = 0; j < l; j++) {
                                        long num = 0;
                                        for (int k = 0; k < m; k++) {
                                                num += A[i][k] * B[k][j];
                                        }
                                        System.out.print(num);
                                        if (j != l - 1) {
                                                System.out.print(" ");
                                        } else {
                                                System.out.print("\n");
                                        }
                                }
                        }
                }
        } try (Scanner sc = new Scanner(System.in)) {
                        int n = sc.nextInt(), m = sc.nextInt(), l = sc.nextInt();
                        long[][] A = new long[n][m];
                        long[][] B = new long[m][l];
                        for (int i = 0; i < n; i++) {
                                for (int j = 0; j < m; j++) {
                                        A[i][j] = sc.nextLong();
                                }
                        }
                        for (int i = 0; i < m; i++) {
                                for (int j = 0; j < l; j++) {
                                        B[i][j] = sc.nextLong();
                                }
                        }
                        for (int i = 0; i < n; i++) {
                                for (int j = 0; j < l; j++) {
                                        long num = 0;
                                        for (int k = 0; k < m; k++) {
                                                num += A[i][k] * B[k][j];
                                        }
                                        System.out.print(num);
                                        if (j != l - 1) {
                                                System.out.print(" ");
                                        } else {
                                                System.out.print("\n");
                                        }
                                }
                        }
                } {
                        int n = sc.nextInt(), m = sc.nextInt(), l = sc.nextInt();
                        long[][] A = new long[n][m];
                        long[][] B = new long[m][l];
                        for (int i = 0; i < n; i++) {
                                for (int j = 0; j < m; j++) {
                                        A[i][j] = sc.nextLong();
                                }
                        }
                        for (int i = 0; i < m; i++) {
                                for (int j = 0; j < l; j++) {
                                        B[i][j] = sc.nextLong();
                                }
                        }
                        for (int i = 0; i < n; i++) {
                                for (int j = 0; j < l; j++) {
                                        long num = 0;
                                        for (int k = 0; k < m; k++) {
                                                num += A[i][k] * B[k][j];
                                        }
                                        System.out.print(num);
                                        if (j != l - 1) {
                                                System.out.print(" ");
                                        } else {
                                                System.out.print("\n");
                                        }
                                }
                        }
                } Scanner sc = new Scanner(System.in) Scanner sc = new Scanner(System.in) new Scanner(System.in) int n = sc.nextInt() n sc.nextInt() sc.nextInt sc m = sc.nextInt() m sc.nextInt() sc.nextInt sc l = sc.nextInt(); l sc.nextInt() sc.nextInt sc long[][] A = new long[n][m]; A new long[n][m] n m long[][] B = new long[m][l]; B new long[m][l] m l for (int i = 0; i < n; i++) {
                                for (int j = 0; j < m; j++) {
                                        A[i][j] = sc.nextLong();
                                }
                        } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
                                for (int j = 0; j < m; j++) {
                                        A[i][j] = sc.nextLong();
                                }
                        } {
                                for (int j = 0; j < m; j++) {
                                        A[i][j] = sc.nextLong();
                                }
                        } for (int j = 0; j < m; j++) {
                                        A[i][j] = sc.nextLong();
                                } int j = 0; int j = 0; j 0 j < m j m j++ j++ j {
                                        A[i][j] = sc.nextLong();
                                } {
                                        A[i][j] = sc.nextLong();
                                } A[i][j] = sc.nextLong() A[i][j] A[i] A i j sc.nextLong() sc.nextLong sc for (int i = 0; i < m; i++) {
                                for (int j = 0; j < l; j++) {
                                        B[i][j] = sc.nextLong();
                                }
                        } int i = 0; int i = 0; i 0 i < m i m i++ i++ i {
                                for (int j = 0; j < l; j++) {
                                        B[i][j] = sc.nextLong();
                                }
                        } {
                                for (int j = 0; j < l; j++) {
                                        B[i][j] = sc.nextLong();
                                }
                        } for (int j = 0; j < l; j++) {
                                        B[i][j] = sc.nextLong();
                                } int j = 0; int j = 0; j 0 j < l j l j++ j++ j {
                                        B[i][j] = sc.nextLong();
                                } {
                                        B[i][j] = sc.nextLong();
                                } B[i][j] = sc.nextLong() B[i][j] B[i] B i j sc.nextLong() sc.nextLong sc for (int i = 0; i < n; i++) {
                                for (int j = 0; j < l; j++) {
                                        long num = 0;
                                        for (int k = 0; k < m; k++) {
                                                num += A[i][k] * B[k][j];
                                        }
                                        System.out.print(num);
                                        if (j != l - 1) {
                                                System.out.print(" ");
                                        } else {
                                                System.out.print("\n");
                                        }
                                }
                        } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
                                for (int j = 0; j < l; j++) {
                                        long num = 0;
                                        for (int k = 0; k < m; k++) {
                                                num += A[i][k] * B[k][j];
                                        }
                                        System.out.print(num);
                                        if (j != l - 1) {
                                                System.out.print(" ");
                                        } else {
                                                System.out.print("\n");
                                        }
                                }
                        } {
                                for (int j = 0; j < l; j++) {
                                        long num = 0;
                                        for (int k = 0; k < m; k++) {
                                                num += A[i][k] * B[k][j];
                                        }
                                        System.out.print(num);
                                        if (j != l - 1) {
                                                System.out.print(" ");
                                        } else {
                                                System.out.print("\n");
                                        }
                                }
                        } for (int j = 0; j < l; j++) {
                                        long num = 0;
                                        for (int k = 0; k < m; k++) {
                                                num += A[i][k] * B[k][j];
                                        }
                                        System.out.print(num);
                                        if (j != l - 1) {
                                                System.out.print(" ");
                                        } else {
                                                System.out.print("\n");
                                        }
                                } int j = 0; int j = 0; j 0 j < l j l j++ j++ j {
                                        long num = 0;
                                        for (int k = 0; k < m; k++) {
                                                num += A[i][k] * B[k][j];
                                        }
                                        System.out.print(num);
                                        if (j != l - 1) {
                                                System.out.print(" ");
                                        } else {
                                                System.out.print("\n");
                                        }
                                } {
                                        long num = 0;
                                        for (int k = 0; k < m; k++) {
                                                num += A[i][k] * B[k][j];
                                        }
                                        System.out.print(num);
                                        if (j != l - 1) {
                                                System.out.print(" ");
                                        } else {
                                                System.out.print("\n");
                                        }
                                } long num = 0; num 0 for (int k = 0; k < m; k++) {
                                                num += A[i][k] * B[k][j];
                                        } int k = 0; int k = 0; k 0 k < m k m k++ k++ k {
                                                num += A[i][k] * B[k][j];
                                        } {
                                                num += A[i][k] * B[k][j];
                                        } num += A[i][k] * B[k][j] num A[i][k] * B[k][j] A[i][k] A[i] A i k B[k][j] B[k] B k j System.out.print(num) System.out.print System.out System System.out num if (j != l - 1) {
                                                System.out.print(" ");
                                        } else {
                                                System.out.print("\n");
                                        } j != l - 1 j l - 1 l 1 {
                                                System.out.print(" ");
                                        } System.out.print(" ") System.out.print System.out System System.out " " {
                                                System.out.print("\n");
                                        } System.out.print("\n") System.out.print System.out System System.out "\n" String args[] args
import java.util.*;

class Main {
        public static void main(String args[]) {
                try (Scanner sc = new Scanner(System.in)) {
                        int n = sc.nextInt(), m = sc.nextInt(), l = sc.nextInt();
                        long[][] A = new long[n][m];
                        long[][] B = new long[m][l];
                        for (int i = 0; i < n; i++) {
                                for (int j = 0; j < m; j++) {
                                        A[i][j] = sc.nextLong();
                                }
                        }
                        for (int i = 0; i < m; i++) {
                                for (int j = 0; j < l; j++) {
                                        B[i][j] = sc.nextLong();
                                }
                        }
                        for (int i = 0; i < n; i++) {
                                for (int j = 0; j < l; j++) {
                                        long num = 0;
                                        for (int k = 0; k < m; k++) {
                                                num += A[i][k] * B[k][j];
                                        }
                                        System.out.print(num);
                                        if (j != l - 1) {
                                                System.out.print(" ");
                                        } else {
                                                System.out.print("\n");
                                        }
                                }
                        }
                }
        }
}