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:
using namespace std;
#include<bits/stdc++.h>

int main(){
	string s, t;
	cin>>s>>t;
	int m=s.size();
	int n=t.size();
	int dp[m+1][n+1];
	for(int i=0;i<=m;i++)
		dp[i][0]=0;
	for(int i=0;i<=n;i++)
		dp[0][i]=0;

	for(int i=1;i<=m;i++){
		for(int j=1;j<=n;j++){
			if(s[i-1] == t[j-1])
				dp[i][j]=1+dp[i-1][j-1];
			else
				dp[i][j]=max(dp[i-1][j], dp[i][j-1]);
		}
	}
	int i=m;
	int j=n;
	string ans="";
	while(i>0 && j>0){
		if(s[i-1] == t[j-1]){
			ans+=s[i-1];
			i--;
			j--;
		}
		else if(dp[i][j-1] > dp[i-1][j])
			j--;
		else
			i--;
	}
	reverse(ans.begin(), ans.end());
	cout<<ans;
	return 0;
}