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