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[3010][3010];
string s , t;
string temp="";
string solve(int m , int n)
{
	if(m==0 || n==0) return "";
	
	if(s[m-1]==t[n-1])
	{
		return solve(m-1 , n-1) + s[m-1];
	}
	else
	{
		if(dp[m-1][n]>dp[m][n-1])
		 return solve(m-1 , n);
		else
		 return solve(m , n-1);
	}
}
int main()
{
	cin>>s>>t;
	for(int i=1;i<=s.size();i++)
	{
		for(int j=1;j<=t.size();j++)
		{
			if(s[i-1]==t[j-1])
				dp[i][j]=1+dp[i-1][j-1];
			else
				dp[i][j]=max(dp[i-1][j] , dp[i][j-1]);
		}
	}
	cout<<solve(s.size() , t.size());
}