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<iostream>
using namespace std;

int dp[3003][3003];
string a,b,ans="";

void pr(int i,int j){
	if(i<=0 || j<=0)return ;
	
	if(a[i-1]==b[j-1]){
		ans=a[i-1]+ans;
		pr(i-1,j-1);
	}
	else if(dp[i-1][j] > dp[i][j-1]){
		pr(i-1,j);
	}
	else pr(i,j-1);
}
int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	cin>>a>>b;
	
	for(int i=0;i<=a.size();i++){
		for(int j=0;j<=b.size();j++){
			if(i==0 || j==0){
				dp[i][j]=0;
			}
			else if(a[i-1]==b[j-1])
				dp[i][j]=1+dp[i-1][j-1];
			else dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
		}
	}
	
	pr(a.size(),b.size());
	
	cout<<ans;
	return 0;
}