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 f[3001][3001]={0};
char s[3001],t[3001],p[3001];
void print(char c)
{
	printf("%c",c);
	return;
}
void dfs(int x,int y)
{
	if(x==0||y==0)
		return;
	if(s[x-1]!=t[y-1])
	{
		if(f[x-1][y]>=f[x][y-1])
			dfs(x-1,y);
		else
			dfs(x,y-1);
	}
	else
		dfs(x-1,y-1);
	if(s[x-1]==t[y-1])	
		print(s[x-1]);
}
int main()
{
	int i,j,n,m;
	scanf("%s",s);
	scanf("%s",t);
	n=strlen(s);
	m=strlen(t);
	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]);
		}
	}
	dfs(n,m);
	return 0;
}