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 main() {
	char s[3005],t[3005];
	scanf("%s%s",s,t);
	int m=strlen(s),n=strlen(t);
	int dp[m+1][n+1];
	memset(dp,0,sizeof(dp));
	for(int i=1;i<=m;i++){
		for(int j=1;j<=n;j++){
			if(s[i-1]==t[j-1])dp[i][j]=dp[i-1][j-1]+1;
			else dp[i][j]=max(dp[i][j-1],dp[i-1][j]);
		}
	}
	string ans;
	int i=m,j=n;
	while(i>0&&j>0){
		if(s[i-1]==t[j-1]){ans.push_back(s[i-1]);i--; j--;}
		else if(dp[i][j]==dp[i][j-1])j--;
		else i--;
	}
	reverse(ans.begin(),ans.end());
	printf("%s",ans.c_str());
}