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,t = input(),input()
n,m=len(s),len(t)
dp = [[0]*(n+1) for _ in range(m+1)]
for i in range(m):
  for j in range(n):
    if t[i] == s[j]:
      dp[i+1][j+1] = max(dp[i][j]+1,dp[i+1][j+1])
    dp[i+1][j+1] = max(dp[i+1][j+1],dp[i+1][j],dp[i][j+1])
ans = ""
cnt = 0
i,j = m,n
while cnt != dp[-1][-1]:
  if dp[i][j] == dp[i][j-1]:
    j -= 1
  elif dp[i][j] == dp[i-1][j]:
    i -= 1
  else:
    ans += s[j-1]
    cnt += 1
    i,j = i-1,j-1

print(ans[::-1])