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:
a = input()
b = input()
dp = [[0]*(len(b)+1) for i in range(len(a)+1)]
for i in range(1,len(a)+1):
  for j in range(1, len(b)+1):
    if a[i-1] == b[j-1]:
      dp[i][j] = 1 + dp[i-1][j-1]
    else:
      dp[i][j] = max(dp[i][j-1], dp[i-1][j])
#print(dp)
ans = []
p = len(a)
t = len(b)
while p>0 and t>0:
  if a[p-1] == b[t-1]:
    ans.insert(0, a[p-1])
    p = p-1
    t = t-1
  else:
    if dp[p][t-1] > dp[p-1][t]:
      t = t-1
    else:
      p = p-1
print("%s" % ''.join(ans))