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 <bits/stdc++.h>
using namespace std;
string sa,sb,ans;
int f[3010][3010];
int main()
{
	cin>>sa>>sb;
	for(int i=1;i<=sa.size();i++)
	{
		for(int j=1;j<=sb.size();j++)
		{
			if(sa[i-1]==sb[j-1])
				f[i][j]=f[i-1][j-1]+1;
			else
				f[i][j]=max(f[i-1][j],f[i][j-1]);
		}
	}
	int i=sa.size(),j=sb.size();
	while(i && j)
	{
		if(sa[i-1]==sb[j-1])
		{
			ans+=sa[i-1];
			i--;
			j--;
			continue;
		}
		if(f[i-1][j]>f[i][j-1])
			i--;
		else
			j--;
	}
	reverse(ans.begin(),ans.end());
	cout<<ans<<endl;
	return 0;
}