import java.util.Scanner;
import java.math.BigInteger;
public class Main
{
	public static void main( String args[] )
	{
		Scanner input = new Scanner(System.in);
		int n = input.nextInt();
		int m = input.nextInt();
		int l = input.nextInt();
		BigInteger s = BigInteger.valueOf(0);
		int[][] a = new int[111][111];
		int[][] b = new int[111][111];
		for(int i = 0; i < n; i++)
			for(int k = 0; k < m; k++)
				a[i][k] = input.nextInt();
		for(int i = 0; i < m; i++)
			for(int k = 0; k < l; k++)
				b[i][k] = input.nextInt();

		for (int i = 0; i < n; i++){
			for (int k = 0; k < l; k++){
				s = BigInteger.valueOf(0);
				for(int j = 0; j < m; j++){
					s = s.add(BigInteger.valueOf(a[i][j] * b[j][k]));
				}

				if(k == l-1)
					System.out.println(s);
				else
					System.out.print(s + " ");
			}
		}
	}
}
/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