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()

ls = len(S)
lt = len(T)

DP = [[0] * (ls+1) for _ in range(lt+1)]

for i in range(lt):
    for j in range(ls):
        if T[i] == S[j]:
            DP[i+1][j+1] = DP[i][j] + 1
        else:
            DP[i+1][j+1] = max(DP[i+1][j], DP[i][j+1])

ans = ''
while ls * lt > 0:
    if DP[lt][ls] == DP[lt-1][ls]:
        lt -= 1
    elif DP[lt][ls] == DP[lt][ls-1]:
        ls -= 1
    elif DP[lt][ls] == DP[lt-1][ls-1] + 1:
        lt -= 1
        ls -= 1
        ans += S[ls]
print(ans[::-1])