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 _ in range(len(s)+1)]

for n in range(len(s)):
    for m in range(len(t)):
        if s[n] == t[m]:
            dp[n+1][m+1] = dp[n][m]+1
        else:
            dp[n+1][m+1] = max(dp[n+1][m],dp[n][m+1])

n = len(s)
m = len(t)
ans = ''
while n >= 0 and m >= 0:
    if dp[n][m] == dp[n-1][m]:
        n -= 1
    elif dp[n][m] == dp[n][m-1]:
        m -= 1
    else:
        ans = s[n-1]+ans
        n -= 1
        m -= 1
print(ans)