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()
{
	ios_base::sync_with_stdio(false),cin.tie(NULL);
	string s,t;
	cin>>s>>t;
	int l1=s.length();
	int l2=t.length();

	vector<vector<int>> dp(l1+1,vector<int>(l2+1,0));

	for(int i=1;i<=l1;i++)
	{
		for(int j=1;j<=l2;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]);
		}
	}

	string res="";
	int i=l1,j=l2;
	while(i>0 and j>0)
	{
		if(s[i-1]==t[j-1])
		{
			res+=s[i-1];
			i--,j--;
		}
		else if(dp[i-1][j]>=dp[i][j-1]) i--;
		else j--;
	}

	reverse(res.begin(),res.end());
	cout<<res;
	return 0;
}