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='0'+input(),'0'+input()
ns,nt=len(s)+1,len(t)+1
dp=[[0 for i in range(nt)] for i in range(ns)]
for i in range(1,ns):
	for j in range(1,nt):
		if s[i-1]==t[j-1]:dp[i][j]=dp[i-1][j-1]+1
		else:dp[i][j]=max(dp[i-1][j],dp[i][j-1])
i,j=ns-1,nt-1
ans=''
while i>0 or j>0:
	if dp[i][j]==dp[i][j-1]:j-=1
	elif dp[i][j]==dp[i-1][j]:i-=1
	else:
		ans=s[i-1]+ans
		i-=1;j-=1
print(ans[1:])