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;
string s,t;
int dp[3007][3007];
int main()
{
	cin>>s>>t;
	int n=s.length(),m=t.length();
	s="*"+s;
	t="."+t;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			dp[i][j]=max(max(dp[i-1][j],dp[i][j-1]),dp[i-1][j-1]+(s[i]==t[j]));
		}
	}
	string ans;
	while(dp[n][m])
	{
		if(dp[n][m]==dp[n][m-1])
		{
           m--;
		}
		else if(dp[n][m]==dp[n-1][m]) n--;
		else
        {
           ans=s[n]+ans;
          n--,m--;
        } 
	}
	cout<<ans<<endl;
}