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()
x = len(s)
y = len(t)
dp = [[0 for _ in range(y+1)] for _ in range(x+1)]

for i in range(x):
	for j in range(y):
		if s[i]==t[j]:
			dp[i+1][j+1] = 1+dp[i][j]
		else:
			dp[i+1][j+1] = max(dp[i][j+1],dp[i+1][j])
i = x
j = y
ans = ''
while i*j!=0:
	if (dp[i][j] == 1 + dp[i-1][j-1]) and (s[i-1]==t[j-1]):
		ans = s[i-1] + ans
		i-=1
		j-=1
			
	else:	
		if dp[i][j] == dp[i-1][j]:
			i-=1
		elif dp[i][j] == dp[i][j-1]:
			j-=1

print(ans)