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()
a = len(s) + 1
b = len(t) + 1

X = [[0] * b for _ in range(a)]
for i in range(1, a):
    for j in range(1, b):
        X[i][j] = max(X[i-1][j], X[i][j-1])
        if s[i-1] == t[j-1]:
            X[i][j] = max(X[i-1][j-1]+1, X[i][j])
        
# print(X)
ans = ""
i = a-1
j = b-1
while i > 0 and j > 0:
    if X[i][j] == X[i-1][j]:
        i -= 1
    elif X[i][j] == X[i][j-1]:
        j -= 1
    else:
        ans = s[i-1] + ans
        i -= 1
        j -= 1
        
print(ans)