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()
S=len(s)
T=len(t)
dp=[[0]*(T+1) for _ in range(S+1)]
for i in range(1,S+1):
    for j in range(1,T+1):
        dp[i][j] = max(dp[i-1][j],dp[i][j-1])
        if s[i-1]==t[j-1]:
            dp[i][j]=dp[i-1][j-1]+1
ans=""
x=S
y=T
l=dp[-1][-1]
while len(ans)<dp[-1][-1]:
    if dp[x][y-1]==l:
        y-=1
    elif dp[x-1][y]==l:
        x-=1
    else:
        ans+=t[y-1]
        x-=1
        y-=1
        l-=1
print(ans[::-1])