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:
import sys
input = lambda: sys.stdin.readline().rstrip()
tdlist = lambda i, j, value=0: [[value] * j for _ in range(i)]

s = input()
t = input()
n, m = len(s), len(t)
dp = tdlist(n+5, m+5)

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

res = []
i, j = n, m
while i and j:
    if dp[i][j] == dp[i-1][j]: i -= 1
    elif dp[i][j] == dp[i][j-1]: j -= 1
    else:
        res.append(s[i-1])
        i -= 1; j -= 1

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