编程题：两个矩阵之积

import sys
while True:
k=sys.stdin.readline()
if not k:
break
else:
m,p,n=map(int,k.split())
juzhen1=[]
juzhen2=[]
juzhen3=[]
for i in range(m):
juzhen1.append(list(map(int,input().split())))
for i in range(p):
juzhen2.append(list(map(int,input().split())))
for i in range(n):
lst=[]
for k in range(p):
lst.append(juzhen2[k][i])
juzhen3.append(lst)
juzhen2=juzhen3[::]
juzhen3=[]
def neiji(a,b):
s=0
for i in range(len(a)):
s+=a[i]*b[i]
return s
for i in range(m):
for k in range(n):
ji=neiji(juzhen1[i],juzhen2[k])
juzhen3.append(ji)
for i in range(m):
hang=juzhen3[n*i:n*i+n]
for i in range(n-1):
print(hang[i],end=' ')
print(hang[-1])