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[3007][3007];

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