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;
int dp[3002][3002],i,j;
string s,t,ans;
int main(){
	cin>>s>>t;
	s+='$';t+='%';
	for(;i<s.size();i++){
		for(j=0;j<t.size();j++){
			dp[i+1][j]=max(dp[i+1][j],dp[i][j]);
			dp[i][j+1]=max(dp[i][j+1],dp[i][j]);
			if(s[i]==t[j])dp[i+1][j+1]=max(dp[i+1][j+1],dp[i][j]+1);
		}
	}
	for(i=s.size()-1,j=t.size()-1;i+j;){
		if(i&&dp[i-1][j]==dp[i][j])i--;
		else if(j&&dp[i][j-1]==dp[i][j])j--;
		else i--,j--,ans+=s[i];
	}
	reverse(ans.begin(),ans.end());
	cout<<ans<<endl;
	return 0;
}