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()
sl=len(s)
tl=len(t)
dp=[[0]*(sl+1) for _ in range(tl+1)]
for i in range(1,tl+1):
  for j in range(1,sl+1):
    if(t[i-1]==s[j-1]):
      dp[i][j]=dp[i-1][j-1]+1
    else:
      dp[i][j]=max(dp[i-1][j],dp[i][j-1])
#print(dp[-1][-1])
i=tl
j=sl
ans=[]
while i>0 and j>0:
  if(t[i-1]==s[j-1]):
    ans.append(t[i-1])
    i=i-1
    j=j-1
  else:
    if(dp[i-1][j]+1>dp[i][j-1]):
      i=i-1
    else:
      j=j-1
#print(ans)
ans.reverse()
print(''.join(ans))