矩阵乘法

def solve(n, m, k, a_data, b_data):
    n, m, k = int(n), int(m), int(k)
    a_rows = str(a_data).strip().split(';')
    b_rows = str(b_data).strip().split(';')
    A = [list(map(int, r.split(','))) for r in a_rows]
    B = [list(map(int, r.split(','))) for r in b_rows]
    C = [[sum(A[i][t]*B[t][j] for t in range(m)) for j in range(k)] for i in range(n)]
    for row in C:
        print(' '.join(map(str, row)))