def move(src, tar):
    pan = src.pop()
    tar.append(pan)

def dfs(n, src, buf, tar):
    if n == 1:
        move(src, tar)
        return

    dfs(n - 1, src, tar, buf)
    move(src, tar)
    dfs(n - 1, buf, src, tar)

def solveHanota(A, B, C):
    n = len(A)
    dfs(n, A, B, C)