"""
출처:프로그래머스,
https://school.programmers.co.kr/learn/courses/30/lessons/12949
"""

# 풀이 과정
from collections import deque


def solution(arr1, arr2):
    result = []

    new = []
    count = 0
    while count < len(arr2[0]):
        check = []
        for k in range(len(arr2)):
            check.append(arr2[k][count])
        new.append(check)
        count += 1

    arr1 = deque(arr1)

    while arr1:
        check = []
        i = arr1.popleft()

        for j in new:
            count = 0
            for v, w in zip(i, j):
                count += v * w
            check.append(count)

        result.append(check)

    return result