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<iostream>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
int dp[3005][3005];
int main()
{
    string a,b;
    cin>>a>>b;
    int x,y,i,j;
    x=a.length();
    y=b.length();
    for(i=x-1;i>=0;i--)
    {
    	for(j=y-1;j>=0;j--)
    	{
    		if(a[i]==b[j])
    		dp[i][j]=dp[i+1][j+1]+1;
    		else
    		dp[i][j]=max(dp[i+1][j],dp[i][j+1]);
		}
	}
	i=0;
	j=0;
	while(i<x&&j<y)
	{
		if(a[i]==b[j])
		{
			cout<<a[i];
			i++;
			j++;
		}
		else if(dp[i][j]==dp[i+1][j])
		i++;
		else j++;
	}
	return 0;
}