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;
const int MAXN=3030;
int dp[MAXN][MAXN],l1,l2;

char s1[MAXN] , s2[MAXN];

void output(int x,int y)
{
	if( !x || !y ) return ;
	
	if(s1[x]==s2[y])
	{
		output( x-1 , y-1 );
		cout<<s1[x];
	}
	else 
	{
		if(dp[x-1][y]>dp[x][y-1])
			output(x-1,y);
		else 
			output(x,y-1);
	}
}

int main()
{
	scanf("%s",s1+1);
	scanf("%s",s2+1);
	l1=strlen(s1+1);l2=strlen(s2+1);

	for(int i=1;i<=l1;++i)
		for(int j=1;j<=l2;++j)
		{
			if(s1[i]==s2[j])
				dp[i][j]=dp[i-1][j-1]+1;
			else 
				dp[i][j]=max(dp[i-1][j],dp[i][j-1]);	
		}
	
	output(l1,l2); 
	
	return 0;
}