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

for i in range(len(s)):
    for j in range(len(t)):
        dp[i+1][j+1]=max(dp[i][j+1],dp[i+1][j],dp[i][j]+(s[i]==t[j]))
        
st=[]
x=len(s)
y=len(t)
while x>0 and y>0:
    if dp[x][y] == dp[x-1][y]:
        x-=1
    elif dp[x][y] ==dp[x][y-1]:
        y-=1
    else:
        x-=1
        y-=1
        st += s[x]
print(''.join(reversed(st)))