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;
#define ll long long
int main() {
	
	string a,b;
	cin>>a>>b;
	int n=a.size(),m=b.size();
	vector<vector<int>> dp(n+1,vector<int> (m+1,0));

	for(int i=1;i<=n;i++)
	for(int j=1;j<=m;j++)
	{
		if(a[i-1]==b[j-1])dp[i][j]=1+dp[i-1][j-1];
		else dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
	}
	
	
	int i=n,j=m;
	string ans="";
	
	while(i>0 and j>0)
	{
		if(a[i-1]==b[j-1])
		{
			
			ans.push_back(a[i-1]);
			i--,j--;
		}
		else
		{
			if(dp[i-1][j]>dp[i][j-1])i--;
			else j--;
			
		}
		
	}
	
	reverse(ans.begin(),ans.end());
	cout<<ans;
	
	
	
}