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

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