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;
const int N = 3e3+5;

string s, t;
int dp[N][N];

void print(int n, int m)
{
	if (!n || !m) return;
	if (s[n-1] == t[m-1])
	{
		print(n - 1, m - 1);
		cout << s[n-1];
	}
	else
	{
		if (dp[n][m] == dp[n-1][m])	print(n - 1, m);
		else	print(n, m - 1);
	}
}

int main()
{
	cin >> s >> t;
	int n = s.length();
	int m = t.length();
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= m; j++)
		{
			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]);
		}
	}
	print(n, m);
	return 0;
}