Problem: You are given strings s and t. Find one longest string that is a subsequence of both s and t.

Constraints

* s and t are strings consisting of lowercase English letters.
* 1 \leq |s|, |t| \leq 3000

Input

Input is given from Standard Input in the following format:


s
t


Output

Print one longest string that is a subsequence of both s and t. If there are multiple such strings, any of them will be accepted.

Examples

Input

axyb
abyxb


Output

axb


Input

aa
xayaz


Output

aa


Input

a
z


Output




Input

abracadabra
avadakedavra


Output

aaadara

Solution (in PYTHON3):

Solution:
s,t=input(),input()
a,b=len(s),len(t)
DP=[[0]*(b+1) for _ in range(a+1)]
for i in range(a):
    for j in range(b):
        if s[i]==t[j]:
            DP[i+1][j+1]=DP[i][j]+1
        else:
            DP[i+1][j+1]=max(DP[i+1][j],DP[i][j+1])
ans=''
while a and b:
    if DP[a][b]==DP[a-1][b]:
        a-=1
    elif DP[a][b]==DP[a][b-1]:
        b-=1
    else:
        ans=s[a-1]+ans
        a-=1
        b-=1
print(ans)