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]*(len(t)+1) for i in range(len(s)+1)]

for i in range(len(s)):
    for j in range(len(t)):
        if s[i]==t[j]:
            DP[i+1][j+1] = max(DP[i][j]+1,DP[i+1][j],DP[i][j+1])
        else:
            DP[i+1][j+1] = max(DP[i+1][j],DP[i][j+1])

i = len(s)
j = len(t)
ans = []
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:
        i-=1
        j-=1
        ans.append(s[i])


print("".join(ans[::-1]))