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 <algorithm>
#include <cstring>
using namespace std;
const int N = 3030;
char a[N],b[N];
int f[N][N];
char ans[N];
int n,m;
int main()
{
	cin >> a >> b;
	int m = strlen(a);
	int n = strlen(b); 
	for(int i = 1; i <= m; i++)
	{
		for(int j = 1; j <= n; j++)
		{
			f[i][j] = max(f[i-1][j],f[i][j-1]);
			if(a[i-1]==b[j-1]) f[i][j] = max(f[i-1][j-1]+1,f[i][j]);
		}
	}
	int i = m, j = n;
	while(f[i][j])
	{
		if(a[i-1] == b[j-1])
		{
			ans[f[i][j]] = a[i-1];
			i--;
			j--;
		}else{
			if(f[i][j] == f[i-1][j]) i--;
			else j--;
		}
	}
	cout << ans + 1 << endl;
}