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;
int f[3010][3010];
int main()
{
	string s,t;
	char ans[3010];
	cin>>s>>t;
	int idx=0;
	for(int i=1;i<=s.size();i++)
		for(int j=1;j<=t.size();j++)
	{
		f[i][j]=max(f[i-1][j],f[i][j-1]);
		if(s[i-1]==t[j-1])
		{
			f[i][j]=max(f[i][j],f[i-1][j-1]+1);
		}
	}
	int i=s.size(),j=t.size();
	while(i&&j)
	{
		if(s[i-1]==t[j-1])
		{
			ans[idx++]=s[i-1];
			i--,j--;
		}
		else if(f[i-1][j]>f[i][j-1])i--;
		else j--;
	}
	for(int i=idx-1;i>-1;i--)cout<<ans[i];

   return 0;
}