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 = [[0] * (m + 1) for _ in range(n + 1)]

for i in range(n):
    for j in range(m):
        dp[i][j] = max([dp[i][j-1], dp[i-1][j], dp[i - 1]
                        [j - 1] + (s[i] == t[j])])

ans = []
i = n - 1
j = m - 1
while i >= 0 and j >= 0:
    if i >= 0 and dp[i - 1][j] == dp[i][j]:
        i -= 1
    elif j >= 0 and dp[i][j - 1] == dp[i][j]:
        j -= 1
    else:
        ans.append(s[i])
        i -= 1
        j -= 1
print("".join(reversed(ans)))