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] * (lt+1) for i in range(ls+1)]

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

ans = ""
while ls > 0 and lt > 0:
  if   dp[ls][lt] == dp[ls-1][lt]: ls -= 1
  elif dp[ls][lt] == dp[ls][lt-1]: lt -= 1
  else:
    ans = S[ls-1] + ans
    ls -= 1
    lt -= 1

print(ans)