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;
#define ll long long
int main()
{
 	string s1,s2;
 	cin>>s1>>s2;
 	int n=s1.length();
 	int m=s2.length();
 	int dp[n+1][m+1];
 	for(int i=0;i<=n;i++)
 	{
 		for(int j=0;j<=m;j++)
		{
			if(i==0 || j==0)
			dp[i][j]=0;
			else if(s1[i-1]==s2[j-1])
			dp[i][j]=dp[i-1][j-1]+1;
			else
			dp[i][j]=max(dp[i][j-1],dp[i-1][j]);
		}	
	}

	int l=dp[n][m];
	string s="";
	int i=n;
	int j=m;
	while(1)
	{
		if(s.length()==l)
		break;
		if(s1[i-1]==s2[j-1])
		{
			s=s1[i-1]+s;
			i--;
			j--;
		}
		else if(dp[i][j-1]>dp[i-1][j])
		j--;
		else
		i--;
	}
	cout<<s;
}