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()

n=len(s)
m=len(t)

dp=[[0 for i in range(m+1)] for i in range(n+1)]

for i in range(n):
 for j in range(m):

  if s[i]==t[j]:
   dp[i+1][j+1]=max(dp[i+1][j+1],dp[i][j]+1)

  dp[i+1][j+1]=max(dp[i+1][j+1],dp[i+1][j])
  dp[i+1][j+1]=max(dp[i+1][j+1],dp[i][j+1])

ans=''
while n>0 and m>0:
 if dp[n][m]==dp[n-1][m]:
  n-=1
 elif dp[n][m]==dp[n][m-1]:
  m-=1
 else:
  m-=1
  n-=1
  ans=s[n]+ans

print(ans)