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;

//var 
string a,b, ans;
int dp[3001][3001],n,m;

int main(){
	cin >> a >> b;
	n = a.size(); m = b.size();
	for(int i = 1; i<=n; i++){
		for(int j = 1; j<=m; j++){
			dp[i][j] = max(dp[i-1][j],dp[i][j-1]);
			if(a[i-1] == b[j-1])dp[i][j] = max(dp[i][j], dp[i-1][j-1]+1);
		}
	} int i = n, j = m; ans = "";
	while(i>0 && j>0){
		if(a[i-1] == b[j-1]) {
			ans += a[i-1];
			//cout << i << " " << j << endl;
			i--; j--;
		}else{
			if(dp[i-1][j]>dp[i][j-1])i--;
			else j--;
		}
	}
	reverse(ans.begin(),ans.end());
	cout << ans << endl;
}