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;
char s[3001],t[3001];
int f[3001][3001];
void fc(int x,int y)
{
	if(x==0||y==0)
	{
		return;
	}
	if(s[x-1]==t[y-1])
	{
		fc(x-1,y-1);
		printf("%c",s[x-1]);
	}
	else
	{
		if(f[x-1][y]>=f[x][y-1])
		{
			fc(x-1,y);
		}
		else if(f[x][y-1]>f[x-1][y])
		{
			fc(x,y-1);
		}
	}
}
int main()
{
	int i,j,n,m;
	scanf("%s\n%s",s,t);
	n=strlen(s);
	m=strlen(t);
	memset(f,0,sizeof(f));
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=m;j++)
		{
			if(s[i-1]==t[j-1])
			{
				f[i][j]=f[i-1][j-1]+1;
			}
			else
			{	
				f[i][j]=max(f[i-1][j],f[i][j-1]);
			}
		}
	}
	fc(n,m);
}