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(){
	string s,t;
	cin>>s>>t;
	int x=s.size();
	int y=t.size();
	int dp[x+1][y+1];
	for(int i=0;i<=x;i++){
		for(int j=0;j<=y;j++){
			if(i==0 || j==0) dp[i][j]=0;
			else if(s[i-1]==t[j-1]) dp[i][j]=dp[i-1][j-1]+1;
			else dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
		}
	}
	char lcs[dp[x][y]+1];
	lcs[dp[x][y]]='\0';
	int i=x,j=y;
	while(i>0 && j>0){
		if(s[i-1]==t[j-1]){
			lcs[dp[x][y]-1]=s[i-1];
			i--,j--,dp[x][y]--;
		}
		else if(dp[i-1][j]>dp[i][j-1]) i--;
		else j--;
	}
	cout<<lcs<<endl;
	return 0;
}