Description
One day, a mathematician hired you to implement "matrix multiplication". The details are shown below:
Note : If you are using visual studio, add #pragma warning(disable:4996) in the first line so that you can use scanf on your local machine
Hint: C[i][j] = A[i][0] * B[0][j] + A[i][1] * B[1][j] + .... A[i][An-1] * B[An-1][j]
Input
You are given two input matrices, A and B.
For each matrix, m represents the number of rows and n represents the number of columns.
It is guaranteed that 2<= m <= 10, 2<= n <= 10 and every value in the given matrices are integers in the range of [0, 100].
Also, you may assume that it is valid to multiply A with B, i.e., number of columns of A equals number of rows of B.
The input format may be described as the following:
Am An
A11 A12 ,,, A1n
A21 A22 ... A2n
...
Bm Bn
B11 B12 ,,, B1n
B21 B22 ... B2n
...
Output
Output the result of matrix multiplication.
All elements in a row should be separated by a space, and make sure there is a trailing space followed by a newline character at the end of each line.