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)
s1=''
dp=[[0 for _ in range(m+1)] for _ in range(n+1)]
for i in range(n+1):
  for j in range(m+1):
    if i==0 or j==0:
      continue
    if s[i-1]==t[j-1]:
    
      dp[i][j]=1+dp[i-1][j-1]
    else:
      dp[i][j]=max(dp[i-1][j],dp[i][j-1])
l=dp[n][m]#ans
i=n#s
j=m#t
while(i>=0 and j>=0):
    if s[i-1]==t[j-1]:
      s1+=s[i-1]
      i-=1
      j-=1
    elif dp[i][j-1]>dp[i-1][j]:
      j-=1
    else:
      i-=1
s2=''
for u in range(dp[n][m]-1,-1,-1):
  s2+=s1[u]
print(s2)