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 rep(i,n) for(int i=0;i<n;i++)
string s,t;
int dp[3010][3010];
string ans="";
signed main(){
	cin>>s>>t;
	rep(i,s.size()){
		rep(j,t.size()){
			if(s[i]==t[j])dp[i+1][j+1]=dp[i][j]+1;
			else dp[i+1][j+1]=max(dp[i][j+1],dp[i+1][j]);
		}
	}
	for(int i=s.size(),j=t.size();i>0&&j>0;){
		if(dp[i][j-1]==dp[i][j])j--;
		else if(dp[i-1][j]==dp[i][j])i--;
		else{
			if(s[i-1]==t[j-1])ans=s[i-1]+ans;
			i--,j--;
		}
	}
	cout<<ans<<endl;
	return 0;
}