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<string>
using namespace std;
string s,t;
int dp[3001][3001];
char ans[3005];
int main()
{
	cin>>s>>t;s=" "+s;t=" "+t;
	int ns=s.size()-1,nt=t.size()-1;
	for(int i=1;i<=ns;i++)
		for(int j=1;j<=nt;j++)
		{
			if(s[i]==t[j])dp[i][j]=dp[i-1][j-1]+1;
			dp[i][j]=max(dp[i][j],max(dp[i][j-1],dp[i-1][j]));
		}
	int i=ns,j=nt,cnt=dp[i][j];ans[cnt+1]='0';
	while(i&&j)
		if(s[i]==t[j])
			ans[cnt--]=s[i],i--,j--;
		else if(dp[i][j]==dp[i-1][j])
			i--;
		else j--;
	for(int i=1;i<=dp[ns][nt];i++)
		cout<<ans[i];
	return 0;
}