import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// n×mの行列Aのnとmの数、m×lの列ベクトルbのmとlの数を取得
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();
		int l = sc.nextInt();

		// aの二次元配列とbの二次元配列、答えを入れるcの一次元配列をつくる
		int[][] a = new int[n][m];
		int[][] b = new int[m][l];
		long[][] c = new long[n][l];

		// aの二次元配列に入力値を入れる
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				a[i][j] = sc.nextInt();
			}
		}

		// bの二次元配列に入力値を入れる
		for (int i = 0; i < m; i++) {
			for (int j = 0; j < l; j++) {
				b[i][j] = sc.nextInt();
			}
		}

		// ansを計算してcの二次元配列に入れる
		long ans = 0;
		int i;
		int j;
		int k;
		for (i = 0; i < n; i++) {
			for (j = 0; j < l; j++) {
				for (k = 0; k < m; k++) {
					ans = ans + a[i][k] * b[k][j];
				}
				c[i][j] = ans;
				ans = 0;
			}
		}

		// 答えcの二次元配列を表示
		for (int row = 0; row < n; row++) {
			for (int column = 0; column < l; column++) {
				System.out.print(c[row][column]);
				if (!(column == l - 1)) {
					System.out.print(" ");
				}
				if (column == l - 1) {
					System.out.println("");
				}
			}
		}
	}
} import java.util.Scanner; Scanner java.util public class Main {

	public static void main(String[] args) {
		// n×mの行列Aのnとmの数、m×lの列ベクトルbのmとlの数を取得
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();
		int l = sc.nextInt();

		// aの二次元配列とbの二次元配列、答えを入れるcの一次元配列をつくる
		int[][] a = new int[n][m];
		int[][] b = new int[m][l];
		long[][] c = new long[n][l];

		// aの二次元配列に入力値を入れる
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				a[i][j] = sc.nextInt();
			}
		}

		// bの二次元配列に入力値を入れる
		for (int i = 0; i < m; i++) {
			for (int j = 0; j < l; j++) {
				b[i][j] = sc.nextInt();
			}
		}

		// ansを計算してcの二次元配列に入れる
		long ans = 0;
		int i;
		int j;
		int k;
		for (i = 0; i < n; i++) {
			for (j = 0; j < l; j++) {
				for (k = 0; k < m; k++) {
					ans = ans + a[i][k] * b[k][j];
				}
				c[i][j] = ans;
				ans = 0;
			}
		}

		// 答えcの二次元配列を表示
		for (int row = 0; row < n; row++) {
			for (int column = 0; column < l; column++) {
				System.out.print(c[row][column]);
				if (!(column == l - 1)) {
					System.out.print(" ");
				}
				if (column == l - 1) {
					System.out.println("");
				}
			}
		}
	}
} Main public static void main(String[] args) {
		// n×mの行列Aのnとmの数、m×lの列ベクトルbのmとlの数を取得
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();
		int l = sc.nextInt();

		// aの二次元配列とbの二次元配列、答えを入れるcの一次元配列をつくる
		int[][] a = new int[n][m];
		int[][] b = new int[m][l];
		long[][] c = new long[n][l];

		// aの二次元配列に入力値を入れる
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				a[i][j] = sc.nextInt();
			}
		}

		// bの二次元配列に入力値を入れる
		for (int i = 0; i < m; i++) {
			for (int j = 0; j < l; j++) {
				b[i][j] = sc.nextInt();
			}
		}

		// ansを計算してcの二次元配列に入れる
		long ans = 0;
		int i;
		int j;
		int k;
		for (i = 0; i < n; i++) {
			for (j = 0; j < l; j++) {
				for (k = 0; k < m; k++) {
					ans = ans + a[i][k] * b[k][j];
				}
				c[i][j] = ans;
				ans = 0;
			}
		}

		// 答えcの二次元配列を表示
		for (int row = 0; row < n; row++) {
			for (int column = 0; column < l; column++) {
				System.out.print(c[row][column]);
				if (!(column == l - 1)) {
					System.out.print(" ");
				}
				if (column == l - 1) {
					System.out.println("");
				}
			}
		}
	} main {
		// n×mの行列Aのnとmの数、m×lの列ベクトルbのmとlの数を取得
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();
		int l = sc.nextInt();

		// aの二次元配列とbの二次元配列、答えを入れるcの一次元配列をつくる
		int[][] a = new int[n][m];
		int[][] b = new int[m][l];
		long[][] c = new long[n][l];

		// aの二次元配列に入力値を入れる
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				a[i][j] = sc.nextInt();
			}
		}

		// bの二次元配列に入力値を入れる
		for (int i = 0; i < m; i++) {
			for (int j = 0; j < l; j++) {
				b[i][j] = sc.nextInt();
			}
		}

		// ansを計算してcの二次元配列に入れる
		long ans = 0;
		int i;
		int j;
		int k;
		for (i = 0; i < n; i++) {
			for (j = 0; j < l; j++) {
				for (k = 0; k < m; k++) {
					ans = ans + a[i][k] * b[k][j];
				}
				c[i][j] = ans;
				ans = 0;
			}
		}

		// 答えcの二次元配列を表示
		for (int row = 0; row < n; row++) {
			for (int column = 0; column < l; column++) {
				System.out.print(c[row][column]);
				if (!(column == l - 1)) {
					System.out.print(" ");
				}
				if (column == l - 1) {
					System.out.println("");
				}
			}
		}
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int m = sc.nextInt(); m sc.nextInt() sc.nextInt sc int l = sc.nextInt(); l sc.nextInt() sc.nextInt sc int[][] a = new int[n][m]; a new int[n][m] n m int[][] b = new int[m][l]; b new int[m][l] m l long[][] c = new long[n][l]; c new long[n][l] n l for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				a[i][j] = sc.nextInt();
			}
		} 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.nextInt();
			}
		} {
			for (int j = 0; j < m; j++) {
				a[i][j] = sc.nextInt();
			}
		} for (int j = 0; j < m; j++) {
				a[i][j] = sc.nextInt();
			} int j = 0; int j = 0; j 0 j < m j m j++ j++ j {
				a[i][j] = sc.nextInt();
			} {
				a[i][j] = sc.nextInt();
			} a[i][j] = sc.nextInt() a[i][j] a[i] a i j sc.nextInt() sc.nextInt sc for (int i = 0; i < m; i++) {
			for (int j = 0; j < l; j++) {
				b[i][j] = sc.nextInt();
			}
		} 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.nextInt();
			}
		} {
			for (int j = 0; j < l; j++) {
				b[i][j] = sc.nextInt();
			}
		} for (int j = 0; j < l; j++) {
				b[i][j] = sc.nextInt();
			} int j = 0; int j = 0; j 0 j < l j l j++ j++ j {
				b[i][j] = sc.nextInt();
			} {
				b[i][j] = sc.nextInt();
			} b[i][j] = sc.nextInt() b[i][j] b[i] b i j sc.nextInt() sc.nextInt sc long ans = 0; ans 0 int i; i int j; j int k; k for (i = 0; i < n; i++) {
			for (j = 0; j < l; j++) {
				for (k = 0; k < m; k++) {
					ans = ans + a[i][k] * b[k][j];
				}
				c[i][j] = ans;
				ans = 0;
			}
		} i = 0; i = 0 i 0 i < n i n i++ i++ i {
			for (j = 0; j < l; j++) {
				for (k = 0; k < m; k++) {
					ans = ans + a[i][k] * b[k][j];
				}
				c[i][j] = ans;
				ans = 0;
			}
		} {
			for (j = 0; j < l; j++) {
				for (k = 0; k < m; k++) {
					ans = ans + a[i][k] * b[k][j];
				}
				c[i][j] = ans;
				ans = 0;
			}
		} for (j = 0; j < l; j++) {
				for (k = 0; k < m; k++) {
					ans = ans + a[i][k] * b[k][j];
				}
				c[i][j] = ans;
				ans = 0;
			} j = 0; j = 0 j 0 j < l j l j++ j++ j {
				for (k = 0; k < m; k++) {
					ans = ans + a[i][k] * b[k][j];
				}
				c[i][j] = ans;
				ans = 0;
			} {
				for (k = 0; k < m; k++) {
					ans = ans + a[i][k] * b[k][j];
				}
				c[i][j] = ans;
				ans = 0;
			} for (k = 0; k < m; k++) {
					ans = ans + a[i][k] * b[k][j];
				} k = 0; k = 0 k 0 k < m k m k++ k++ k {
					ans = ans + a[i][k] * b[k][j];
				} {
					ans = ans + a[i][k] * b[k][j];
				} ans = ans + a[i][k] * b[k][j] ans ans + a[i][k] * b[k][j] ans a[i][k] * b[k][j] a[i][k] a[i] a i k b[k][j] b[k] b k j c[i][j] = ans c[i][j] c[i] c i j ans ans = 0 ans 0 for (int row = 0; row < n; row++) {
			for (int column = 0; column < l; column++) {
				System.out.print(c[row][column]);
				if (!(column == l - 1)) {
					System.out.print(" ");
				}
				if (column == l - 1) {
					System.out.println("");
				}
			}
		} int row = 0; int row = 0; row 0 row < n row n row++ row++ row {
			for (int column = 0; column < l; column++) {
				System.out.print(c[row][column]);
				if (!(column == l - 1)) {
					System.out.print(" ");
				}
				if (column == l - 1) {
					System.out.println("");
				}
			}
		} {
			for (int column = 0; column < l; column++) {
				System.out.print(c[row][column]);
				if (!(column == l - 1)) {
					System.out.print(" ");
				}
				if (column == l - 1) {
					System.out.println("");
				}
			}
		} for (int column = 0; column < l; column++) {
				System.out.print(c[row][column]);
				if (!(column == l - 1)) {
					System.out.print(" ");
				}
				if (column == l - 1) {
					System.out.println("");
				}
			} int column = 0; int column = 0; column 0 column < l column l column++ column++ column {
				System.out.print(c[row][column]);
				if (!(column == l - 1)) {
					System.out.print(" ");
				}
				if (column == l - 1) {
					System.out.println("");
				}
			} {
				System.out.print(c[row][column]);
				if (!(column == l - 1)) {
					System.out.print(" ");
				}
				if (column == l - 1) {
					System.out.println("");
				}
			} System.out.print(c[row][column]) System.out.print System.out System System.out c[row][column] c[row] c row column if (!(column == l - 1)) {
					System.out.print(" ");
				} !(column == l - 1) (column == l - 1) column l - 1 l 1 {
					System.out.print(" ");
				} System.out.print(" ") System.out.print System.out System System.out " " if (column == l - 1) {
					System.out.println("");
				} column == l - 1 column l - 1 l 1 {
					System.out.println("");
				} System.out.println("") System.out.println System.out System System.out "" String[] args args public class Main {

	public static void main(String[] args) {
		// n×mの行列Aのnとmの数、m×lの列ベクトルbのmとlの数を取得
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();
		int l = sc.nextInt();

		// aの二次元配列とbの二次元配列、答えを入れるcの一次元配列をつくる
		int[][] a = new int[n][m];
		int[][] b = new int[m][l];
		long[][] c = new long[n][l];

		// aの二次元配列に入力値を入れる
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				a[i][j] = sc.nextInt();
			}
		}

		// bの二次元配列に入力値を入れる
		for (int i = 0; i < m; i++) {
			for (int j = 0; j < l; j++) {
				b[i][j] = sc.nextInt();
			}
		}

		// ansを計算してcの二次元配列に入れる
		long ans = 0;
		int i;
		int j;
		int k;
		for (i = 0; i < n; i++) {
			for (j = 0; j < l; j++) {
				for (k = 0; k < m; k++) {
					ans = ans + a[i][k] * b[k][j];
				}
				c[i][j] = ans;
				ans = 0;
			}
		}

		// 答えcの二次元配列を表示
		for (int row = 0; row < n; row++) {
			for (int column = 0; column < l; column++) {
				System.out.print(c[row][column]);
				if (!(column == l - 1)) {
					System.out.print(" ");
				}
				if (column == l - 1) {
					System.out.println("");
				}
			}
		}
	}
} public class Main {

	public static void main(String[] args) {
		// n×mの行列Aのnとmの数、m×lの列ベクトルbのmとlの数を取得
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();
		int l = sc.nextInt();

		// aの二次元配列とbの二次元配列、答えを入れるcの一次元配列をつくる
		int[][] a = new int[n][m];
		int[][] b = new int[m][l];
		long[][] c = new long[n][l];

		// aの二次元配列に入力値を入れる
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				a[i][j] = sc.nextInt();
			}
		}

		// bの二次元配列に入力値を入れる
		for (int i = 0; i < m; i++) {
			for (int j = 0; j < l; j++) {
				b[i][j] = sc.nextInt();
			}
		}

		// ansを計算してcの二次元配列に入れる
		long ans = 0;
		int i;
		int j;
		int k;
		for (i = 0; i < n; i++) {
			for (j = 0; j < l; j++) {
				for (k = 0; k < m; k++) {
					ans = ans + a[i][k] * b[k][j];
				}
				c[i][j] = ans;
				ans = 0;
			}
		}

		// 答えcの二次元配列を表示
		for (int row = 0; row < n; row++) {
			for (int column = 0; column < l; column++) {
				System.out.print(c[row][column]);
				if (!(column == l - 1)) {
					System.out.print(" ");
				}
				if (column == l - 1) {
					System.out.println("");
				}
			}
		}
	}
} Main
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// n×mの行列Aのnとmの数、m×lの列ベクトルbのmとlの数を取得
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();
		int l = sc.nextInt();

		// aの二次元配列とbの二次元配列、答えを入れるcの一次元配列をつくる
		int[][] a = new int[n][m];
		int[][] b = new int[m][l];
		long[][] c = new long[n][l];

		// aの二次元配列に入力値を入れる
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				a[i][j] = sc.nextInt();
			}
		}

		// bの二次元配列に入力値を入れる
		for (int i = 0; i < m; i++) {
			for (int j = 0; j < l; j++) {
				b[i][j] = sc.nextInt();
			}
		}

		// ansを計算してcの二次元配列に入れる
		long ans = 0;
		int i;
		int j;
		int k;
		for (i = 0; i < n; i++) {
			for (j = 0; j < l; j++) {
				for (k = 0; k < m; k++) {
					ans = ans + a[i][k] * b[k][j];
				}
				c[i][j] = ans;
				ans = 0;
			}
		}

		// 答えcの二次元配列を表示
		for (int row = 0; row < n; row++) {
			for (int column = 0; column < l; column++) {
				System.out.print(c[row][column]);
				if (!(column == l - 1)) {
					System.out.print(" ");
				}
				if (column == l - 1) {
					System.out.println("");
				}
			}
		}
	}
}
