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 chmax(a,b) if(a<b)a=b
#define pb push_back
const int N=3011;

string s1,s2;
string ans;
int dp[N][N];

int main()
{
	
	cin>>s1>>s2;
	s1+='('; s2+=')';
	for(int i=0;i<s1.size();i++)
	for(int j=0;j<s2.size();j++)
	{
		chmax(dp[i+1][j],dp[i][j]);
		chmax(dp[i][j+1],dp[i][j]);
		if(s1[i]==s2[j]) chmax(dp[i+1][j+1],dp[i][j]+1);
	}
	int i=s1.size()-1;
	int j=s2.size()-1;
	while(i && j)
		if(dp[i][j]==dp[i-1][j]) i--;
		else if(dp[i][j]==dp[i][j-1]) j--;
		else i--,j--,ans.pb(s1[i]);
	reverse(ans.begin(),ans.end());
	cout<<ans<<'\n';
	
	return 0;
}