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 dp[3001][3001];

int main(){
	string s,t,r="";
	cin >> s >> t;
	int n=s.length();
	int m=t.length();
	for(int i=0;i<=n;i++)
		dp[i][0]=0;
	for(int i=1;i<=m;i++)
		dp[0][i]=0;
	for(int i=1;i<=s.length();i++){
		for(int j=1;j<=t.length();j++){
			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]);
		}
	}
	//cout<<dp[n][m];
	while(n&&m){
		if(dp[n][m]==dp[n-1][m])
			n--;
		else if(dp[n][m]==dp[n][m-1])
			m--;
		else{
			r=s[n-1]+r;
			n--;
			m--;
		}
	}
	cout<<r;
}