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()
n = len(s)
m = len(t)
dp=[]
for i in range(n+1):
    dp.append([0]*(m+1))
for i in range(1,n+1):
    for j in range(1,m+1):
        if(s[i-1]==t[j-1]):
            dp[i][j] = 1 + dp[i-1][j-1]
        else:
            dp[i][j] = max(dp[i-1][j],dp[i][j-1])
ans=""
i=n
j=m
while(i>0 and j>0):
    if(dp[i][j]==dp[i-1][j]):
        i-=1
    elif(dp[i][j]==dp[i][j-1]):
        j-=1
    else:
        ans+=s[i-1]
        i-=1
        j-=1
print(ans[::-1])