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

见题面

见题面