// n×mの行列 A と m×l の行列 B を入力し、それらの積である n×l の行列 C を出力するプログラムを作成してください。

import java.util.Scanner;

class Main{
	public static void main(String[] args){
		Scanner scan = new Scanner(System.in);

		// n, m, lの読み込み
		String scan_str = scan.nextLine();
		String[] first_str = scan_str.split(" ");
		int n = Integer.parseInt(first_str[0]);
		int m = Integer.parseInt(first_str[1]);
		int l = Integer.parseInt(first_str[2]);

		String[] m_count = new String[m];
		String[] l_count = new String[l];

		long[][] A = new long[n][m];
		long[][] B = new long[m][l];
		long[][] C = new long[n][l];

		// ループカウンタ
		int i = 0;
		int j = 0;
		int k = 0;

		// 行列 A の読み込み
		for(i=0; i<n; i++){
			scan_str = scan.nextLine();
			m_count = scan_str.split(" ");
			for(j=0; j<m; j++){
				A[i][j] = Long.parseLong(m_count[j]);
			}
		}

		// 行列 B の読み込み
		for(i=0; i<m; i++){
			scan_str = scan.nextLine();
			l_count = scan_str.split(" ");
			for(j=0; j<l; j++){
				B[i][j] = Long.parseLong(l_count[j]);
			}
		}
		// 行列 C の算出
		for(i=0; i<n; i++){
			for(j=0; j<l; j++){
				for(k=0; k<m; k++){
					C[i][j] = C[i][j] + (A[i][k] * B[k][j]);
				}
				if(j == (l-1)){
					System.out.println(C[i][j]);
				}else {
					System.out.print(C[i][j] + " ");
				}
			}
		}
	}
} import java.util.Scanner; Scanner java.util class Main{
	public static void main(String[] args){
		Scanner scan = new Scanner(System.in);

		// n, m, lの読み込み
		String scan_str = scan.nextLine();
		String[] first_str = scan_str.split(" ");
		int n = Integer.parseInt(first_str[0]);
		int m = Integer.parseInt(first_str[1]);
		int l = Integer.parseInt(first_str[2]);

		String[] m_count = new String[m];
		String[] l_count = new String[l];

		long[][] A = new long[n][m];
		long[][] B = new long[m][l];
		long[][] C = new long[n][l];

		// ループカウンタ
		int i = 0;
		int j = 0;
		int k = 0;

		// 行列 A の読み込み
		for(i=0; i<n; i++){
			scan_str = scan.nextLine();
			m_count = scan_str.split(" ");
			for(j=0; j<m; j++){
				A[i][j] = Long.parseLong(m_count[j]);
			}
		}

		// 行列 B の読み込み
		for(i=0; i<m; i++){
			scan_str = scan.nextLine();
			l_count = scan_str.split(" ");
			for(j=0; j<l; j++){
				B[i][j] = Long.parseLong(l_count[j]);
			}
		}
		// 行列 C の算出
		for(i=0; i<n; i++){
			for(j=0; j<l; j++){
				for(k=0; k<m; k++){
					C[i][j] = C[i][j] + (A[i][k] * B[k][j]);
				}
				if(j == (l-1)){
					System.out.println(C[i][j]);
				}else {
					System.out.print(C[i][j] + " ");
				}
			}
		}
	}
} Main public static void main(String[] args){
		Scanner scan = new Scanner(System.in);

		// n, m, lの読み込み
		String scan_str = scan.nextLine();
		String[] first_str = scan_str.split(" ");
		int n = Integer.parseInt(first_str[0]);
		int m = Integer.parseInt(first_str[1]);
		int l = Integer.parseInt(first_str[2]);

		String[] m_count = new String[m];
		String[] l_count = new String[l];

		long[][] A = new long[n][m];
		long[][] B = new long[m][l];
		long[][] C = new long[n][l];

		// ループカウンタ
		int i = 0;
		int j = 0;
		int k = 0;

		// 行列 A の読み込み
		for(i=0; i<n; i++){
			scan_str = scan.nextLine();
			m_count = scan_str.split(" ");
			for(j=0; j<m; j++){
				A[i][j] = Long.parseLong(m_count[j]);
			}
		}

		// 行列 B の読み込み
		for(i=0; i<m; i++){
			scan_str = scan.nextLine();
			l_count = scan_str.split(" ");
			for(j=0; j<l; j++){
				B[i][j] = Long.parseLong(l_count[j]);
			}
		}
		// 行列 C の算出
		for(i=0; i<n; i++){
			for(j=0; j<l; j++){
				for(k=0; k<m; k++){
					C[i][j] = C[i][j] + (A[i][k] * B[k][j]);
				}
				if(j == (l-1)){
					System.out.println(C[i][j]);
				}else {
					System.out.print(C[i][j] + " ");
				}
			}
		}
	} main {
		Scanner scan = new Scanner(System.in);

		// n, m, lの読み込み
		String scan_str = scan.nextLine();
		String[] first_str = scan_str.split(" ");
		int n = Integer.parseInt(first_str[0]);
		int m = Integer.parseInt(first_str[1]);
		int l = Integer.parseInt(first_str[2]);

		String[] m_count = new String[m];
		String[] l_count = new String[l];

		long[][] A = new long[n][m];
		long[][] B = new long[m][l];
		long[][] C = new long[n][l];

		// ループカウンタ
		int i = 0;
		int j = 0;
		int k = 0;

		// 行列 A の読み込み
		for(i=0; i<n; i++){
			scan_str = scan.nextLine();
			m_count = scan_str.split(" ");
			for(j=0; j<m; j++){
				A[i][j] = Long.parseLong(m_count[j]);
			}
		}

		// 行列 B の読み込み
		for(i=0; i<m; i++){
			scan_str = scan.nextLine();
			l_count = scan_str.split(" ");
			for(j=0; j<l; j++){
				B[i][j] = Long.parseLong(l_count[j]);
			}
		}
		// 行列 C の算出
		for(i=0; i<n; i++){
			for(j=0; j<l; j++){
				for(k=0; k<m; k++){
					C[i][j] = C[i][j] + (A[i][k] * B[k][j]);
				}
				if(j == (l-1)){
					System.out.println(C[i][j]);
				}else {
					System.out.print(C[i][j] + " ");
				}
			}
		}
	} Scanner scan = new Scanner(System.in); scan new Scanner(System.in) String scan_str = scan.nextLine(); scan_str scan.nextLine() scan.nextLine scan String[] first_str = scan_str.split(" "); first_str scan_str.split(" ") scan_str.split scan_str " " int n = Integer.parseInt(first_str[0]); n Integer.parseInt(first_str[0]) Integer.parseInt Integer first_str[0] first_str 0 int m = Integer.parseInt(first_str[1]); m Integer.parseInt(first_str[1]) Integer.parseInt Integer first_str[1] first_str 1 int l = Integer.parseInt(first_str[2]); l Integer.parseInt(first_str[2]) Integer.parseInt Integer first_str[2] first_str 2 String[] m_count = new String[m]; m_count new String[m] m String[] l_count = new String[l]; l_count new String[l] l 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 long[][] C = new long[n][l]; C new long[n][l] n l int i = 0; i 0 int j = 0; j 0 int k = 0; k 0 for(i=0; i<n; i++){
			scan_str = scan.nextLine();
			m_count = scan_str.split(" ");
			for(j=0; j<m; j++){
				A[i][j] = Long.parseLong(m_count[j]);
			}
		} i=0; i=0 i 0 i<n i n i++ i++ i {
			scan_str = scan.nextLine();
			m_count = scan_str.split(" ");
			for(j=0; j<m; j++){
				A[i][j] = Long.parseLong(m_count[j]);
			}
		} {
			scan_str = scan.nextLine();
			m_count = scan_str.split(" ");
			for(j=0; j<m; j++){
				A[i][j] = Long.parseLong(m_count[j]);
			}
		} scan_str = scan.nextLine() scan_str scan.nextLine() scan.nextLine scan m_count = scan_str.split(" ") m_count scan_str.split(" ") scan_str.split scan_str " " for(j=0; j<m; j++){
				A[i][j] = Long.parseLong(m_count[j]);
			} j=0; j=0 j 0 j<m j m j++ j++ j {
				A[i][j] = Long.parseLong(m_count[j]);
			} {
				A[i][j] = Long.parseLong(m_count[j]);
			} A[i][j] = Long.parseLong(m_count[j]) A[i][j] A[i] A i j Long.parseLong(m_count[j]) Long.parseLong Long m_count[j] m_count j for(i=0; i<m; i++){
			scan_str = scan.nextLine();
			l_count = scan_str.split(" ");
			for(j=0; j<l; j++){
				B[i][j] = Long.parseLong(l_count[j]);
			}
		} i=0; i=0 i 0 i<m i m i++ i++ i {
			scan_str = scan.nextLine();
			l_count = scan_str.split(" ");
			for(j=0; j<l; j++){
				B[i][j] = Long.parseLong(l_count[j]);
			}
		} {
			scan_str = scan.nextLine();
			l_count = scan_str.split(" ");
			for(j=0; j<l; j++){
				B[i][j] = Long.parseLong(l_count[j]);
			}
		} scan_str = scan.nextLine() scan_str scan.nextLine() scan.nextLine scan l_count = scan_str.split(" ") l_count scan_str.split(" ") scan_str.split scan_str " " for(j=0; j<l; j++){
				B[i][j] = Long.parseLong(l_count[j]);
			} j=0; j=0 j 0 j<l j l j++ j++ j {
				B[i][j] = Long.parseLong(l_count[j]);
			} {
				B[i][j] = Long.parseLong(l_count[j]);
			} B[i][j] = Long.parseLong(l_count[j]) B[i][j] B[i] B i j Long.parseLong(l_count[j]) Long.parseLong Long l_count[j] l_count j for(i=0; i<n; i++){
			for(j=0; j<l; j++){
				for(k=0; k<m; k++){
					C[i][j] = C[i][j] + (A[i][k] * B[k][j]);
				}
				if(j == (l-1)){
					System.out.println(C[i][j]);
				}else {
					System.out.print(C[i][j] + " ");
				}
			}
		} 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++){
					C[i][j] = C[i][j] + (A[i][k] * B[k][j]);
				}
				if(j == (l-1)){
					System.out.println(C[i][j]);
				}else {
					System.out.print(C[i][j] + " ");
				}
			}
		} {
			for(j=0; j<l; j++){
				for(k=0; k<m; k++){
					C[i][j] = C[i][j] + (A[i][k] * B[k][j]);
				}
				if(j == (l-1)){
					System.out.println(C[i][j]);
				}else {
					System.out.print(C[i][j] + " ");
				}
			}
		} for(j=0; j<l; j++){
				for(k=0; k<m; k++){
					C[i][j] = C[i][j] + (A[i][k] * B[k][j]);
				}
				if(j == (l-1)){
					System.out.println(C[i][j]);
				}else {
					System.out.print(C[i][j] + " ");
				}
			} j=0; j=0 j 0 j<l j l j++ j++ j {
				for(k=0; k<m; k++){
					C[i][j] = C[i][j] + (A[i][k] * B[k][j]);
				}
				if(j == (l-1)){
					System.out.println(C[i][j]);
				}else {
					System.out.print(C[i][j] + " ");
				}
			} {
				for(k=0; k<m; k++){
					C[i][j] = C[i][j] + (A[i][k] * B[k][j]);
				}
				if(j == (l-1)){
					System.out.println(C[i][j]);
				}else {
					System.out.print(C[i][j] + " ");
				}
			} for(k=0; k<m; k++){
					C[i][j] = C[i][j] + (A[i][k] * B[k][j]);
				} k=0; k=0 k 0 k<m k m k++ k++ k {
					C[i][j] = C[i][j] + (A[i][k] * B[k][j]);
				} {
					C[i][j] = C[i][j] + (A[i][k] * B[k][j]);
				} C[i][j] = C[i][j] + (A[i][k] * B[k][j]) C[i][j] C[i] C i j C[i][j] + (A[i][k] * B[k][j]) C[i][j] C[i] C i j (A[i][k] * B[k][j]) A[i][k] A[i] A i k B[k][j] B[k] B k j if(j == (l-1)){
					System.out.println(C[i][j]);
				}else {
					System.out.print(C[i][j] + " ");
				} j == (l-1) j (l-1) l 1 {
					System.out.println(C[i][j]);
				} System.out.println(C[i][j]) System.out.println System.out System System.out C[i][j] C[i] C i j {
					System.out.print(C[i][j] + " ");
				} System.out.print(C[i][j] + " ") System.out.print System.out System System.out C[i][j] + " " C[i][j] C[i] C i j " " String[] args args
// n×mの行列 A と m×l の行列 B を入力し、それらの積である n×l の行列 C を出力するプログラムを作成してください。

import java.util.Scanner;

class Main{
	public static void main(String[] args){
		Scanner scan = new Scanner(System.in);

		// n, m, lの読み込み
		String scan_str = scan.nextLine();
		String[] first_str = scan_str.split(" ");
		int n = Integer.parseInt(first_str[0]);
		int m = Integer.parseInt(first_str[1]);
		int l = Integer.parseInt(first_str[2]);

		String[] m_count = new String[m];
		String[] l_count = new String[l];

		long[][] A = new long[n][m];
		long[][] B = new long[m][l];
		long[][] C = new long[n][l];

		// ループカウンタ
		int i = 0;
		int j = 0;
		int k = 0;

		// 行列 A の読み込み
		for(i=0; i<n; i++){
			scan_str = scan.nextLine();
			m_count = scan_str.split(" ");
			for(j=0; j<m; j++){
				A[i][j] = Long.parseLong(m_count[j]);
			}
		}

		// 行列 B の読み込み
		for(i=0; i<m; i++){
			scan_str = scan.nextLine();
			l_count = scan_str.split(" ");
			for(j=0; j<l; j++){
				B[i][j] = Long.parseLong(l_count[j]);
			}
		}
		// 行列 C の算出
		for(i=0; i<n; i++){
			for(j=0; j<l; j++){
				for(k=0; k<m; k++){
					C[i][j] = C[i][j] + (A[i][k] * B[k][j]);
				}
				if(j == (l-1)){
					System.out.println(C[i][j]);
				}else {
					System.out.print(C[i][j] + " ");
				}
			}
		}
	}
}
