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 main()
{
	string s,t;
	cin>>s>>t;
	int dp[s.length()+3][t.length()+3];
	memset(dp,0,sizeof(dp));
	for(int i=0;i<=s.length();i++)
	{
		for(int j=0;j<=t.length();j++)
		{
			if(i==0 || j==0)
					dp[i][j]=0;
			else if(s[i-1]==t[j-1])
				dp[i][j]=dp[i-1][j-1]+1;
			else
				dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
		}
	}
	string ans="";
	int m=s.length();
	int n=t.length();
	while(m>0 && n>0)
	{
		if(s[m-1]==t[n-1])
			{ans+=s[m-1];m--;n--;}
		else
		{
			if(dp[m-1][n]>dp[m][n-1])
				m--;
			else
				n--;
		}

	}
	reverse(ans.begin(),ans.end());
	cout<<ans<<endl;
}