样例和下载的第一个点的数据，自己测试都没问题，结果怎么全re？？？ 递归写的有点烂，大佬们见谅

def change(list):
    for i in range(len(list)):
        list[i]=ord(list[i])
    return list
def change2(list):
    for i in range(len(list)):
        list[i]=chr(list[i])
    return list
def cut(list,str):
    ans=[]
    for i in range(len(list)):
        if list[i]==str:
            ans.append(list[0:i])
            ans.append(list[i+1:len(list)])
            return ans
    return 0

def tree(left,right,ans):
    if right==left and len(right) <= 2:
        ans.extend(right[::-1])
    else:
        ans.append(right[-1])
        tmp1=cut(left,right[-1])[0]
        tmp2=cut(left,right[-1])[1]
        for i in range(len(right)):
            if right[i] in tmp1:
                tmp1_1=right[i:i+len(tmp1)]
                break
        for i in range(len(right)):
            if right[i] in tmp2:
                tmp2_2=right[i:i+len(tmp2)]
                break
        tree(tmp1,tmp1_1,ans)
        tree(tmp2,tmp2_2,ans)


left=list(input())
right=list(input())
change(left)
change(right)
ans=[]
tree(left,right,ans)
ans=change2(ans)
for i in ans:
    print(i,end='')