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;
char s[3001];
char t[3001];
string ans;
int dp[3001][3001];
int main()
{
	scanf("%s%s",s,t);
	int n=strlen(s);
	int m=strlen(t);
	dp[0][0]=0;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			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]);
			}
			
		}
	}
	//cout<<dp[n][m];
	int i=n,j=m;
	while(i>0&&j>0)
	{
		if(dp[i][j]==dp[i][j-1])
		{
			j--;
		}else if(dp[i][j]==dp[i-1][j])
		{
			i--;
		}
		else
		{
			ans+=s[i-1];
			j--;i--;
		}
	}
	reverse(ans.begin(),ans.end());
	cout<<ans;
	
}