宇宙超级无敌的（矩阵乘法）！！

解题思路:C[i][j] = A[i][0]*B[0][j] + A[i][1]*B[1][j] + …… +A[i][m-1]*B[m-1][j](C[i][j]表示C矩阵中第i行第j列元素)
注意事项:

参考代码:

n, m, k = map(int, input().split())

A = []

B = []

for z in range(n):

    A.append(list(map(int, input().split())))

for y in range(m):

    B.append(list(map(int, input().split())))

C = [[0 for i in range(k)] for i in range(n)] #多维数据，可自行查阅

for i in range(n):

    for j in range(k):

        for q in range(m):

            C[i][j] += A[i][q]*B[q][j]

        print(C[i][j], end=' ')

    print('')