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]*(Ls+1) for i in range(Lt+1)]
Lans = 0

for i in range(1,Lt+1):
  for j in range(1,Ls+1):
    if s[j-1] == t[i-1]:
      dp[i][j] = dp[i-1][j-1] + 1
    else:
      dp[i][j] = max(dp[i-1][j], dp[i][j-1])
    Lans = max(Lans,dp[i][j])
i = Lt
j = Ls
ans = [""]*Lans
count = 0
while Lans > 0:
  if dp[i][j] == dp[i-1][j]:
    i -= 1
  elif dp[i][j] == dp[i][j-1]:
    j -= 1
  else:
    ans[Lans-1] = s[j-1]
    i -= 1
    j -= 1
    Lans -= 1
print("".join(ans))