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 CPP):

Solution:
#include<iostream>
#include<math.h>
using namespace std;
string s,t,re;
long long f[3003][3003];
int main()
{
	cin>>s>>t;
	s = " "+s;
	t = " "+t;
	for(int i = 1;i < s.size();i++)
		for(int j = 1;j < t.size();j++)
		{
			if(s[i] == t[j])
				f[i][j] = f[i-1][j-1]+1;
			else
				f[i][j] = max(f[i-1][j],f[i][j-1]);
		}
	int a = s.size()-1,b = t.size()-1;
	while(b > 0 && a > 0)
	{
		if(f[a][b] != max(f[a-1][b],f[a][b-1]))
		{
			re.push_back(s[a]);
			a--;
			b--;
		}
		else
			if(f[a][b] == f[a-1][b])a--;
			else b--;
	}
	for(int i = re.size()-1;i >= 0;i--)
		cout<<re[i];
}