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[3001][3001],n,m;
pair<int,int> path[3001][3001];
string ans;
void findpath(int i,int j){
	while(i>0&&j>0){
		if(s[i]==t[j]){
			ans+=s[i];
			i--;j--;
		}
		else{
			if(dp[i-1][j]>dp[i][j-1])	i--;
			else						j--;
		}
	}
}
int main(){
	cin>>s>>t;
	s=" "+s;t=" "+t;
	for(int i=1;i<s.size();i++)
		for(int j=1;j<t.size();j++){
			if(s[i]==t[j])
				dp[i][j]=dp[i-1][j-1]+1;
			else
				dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
		}
	findpath(s.size()-1,t.size()-1);
	reverse(ans.begin(),ans.end());
	cout<<ans<<endl;
}