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<cstring>
using namespace std;
const int maxn=10000;
int dp[maxn][maxn];
int main()
{
	char s[maxn],t[maxn],a[maxn];
	cin>>s+1>>t+1;
	for(int i=1;i<=strlen(s+1);i++)
	{
		for(int j=1;j<=strlen(t+1);j++)
		{
			if(s[i]==t[j])
			dp[i][j]=dp[i-1][j-1]+1;
			else
			dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
		}
	}
	int l,r,k=0;
	for(l=strlen(s+1),r=strlen(t+1);l>=1&&r>=1;)
	{
		if(s[l]==t[r])
		{
			a[k++]=s[l];
			l--;
			r--;
		}
		else if(dp[l][r]==dp[l-1][r])
		{
			l--;
		}
		else
		{
			r--;
		}
	}
	for(int i=strlen(a)-1;i>=0;i--)
	cout<<a[i];
	return 0;
}