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=input()
t=input()
sl=len(s)
tl=len(t)
dp=[[0 for i in range(tl+1)] for _ in range(sl+1)]

for i in range(sl):
    for j in range(tl):
        if s[i]==t[j]:
            dp[i+1][j+1]=max(dp[i][j]+1,dp[i+1][j+1])
        dp[i+1][j+1]=max(dp[i+1][j+1],dp[i+1][j],dp[i][j+1])

ans=str()
while sl>0 and tl>0:
    if dp[sl][tl]==dp[sl-1][tl]:
        sl-=1
    elif dp[sl][tl]==dp[sl][tl-1]:
        tl-=1
    else:
        ans+=s[sl-1]
        sl-=1
        tl-=1

print(ans[::-1])