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>
#define N 3001
using namespace std;

string s, t, ans;
int ss, tt, dp[N][N];

int main() {
	cin>>s>>t;
	ss=s.size(),tt=t.size();
	for (int i=1; i<=ss; i++) {
		for (int j=1; j<=tt; j++) {
			dp[i][j]=max(dp[i][j-1],dp[i-1][j]);
			if (s[i-1]==t[j-1]) dp[i][j]=max(dp[i][j],dp[i-1][j-1]+1);
		}
	}
	for (int i=ss,j=tt; 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<<endl;
	return 0;
}