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 s1,s2;	cin>>s1>>s2;
	int n1=s1.size(), n2 = s2.size();

	int dp[n1+1][n2+1];

	memset(dp, 0, sizeof(dp));

	for(int i=1;i<=n1;++i)
	{
		for(int j=1;j<=n2;++j)
		{
			if(s1[i-1]==s2[j-1])
				dp[i][j] = 1+ dp[i-1][j-1];
			else
				dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
		}
	}

	string ans="";
	int i=n1, j=n2;

	while(i>0 && j>0)
	{
		if(dp[i][j] == dp[i-1][j])	i--;
		else if(dp[i][j] == dp[i][j-1])	j--;
		else	ans+= (char)s1[i-1], i--, j--; 
	}
	
	reverse(ans.begin(), ans.end());
	cout<<(ans.size()?ans:"")<<endl;
}