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>

#define fi first
#define se second

using namespace std;

typedef pair<int, int> ii;

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

int main()
{
	cin >> s >> t;
	for(int i = 1; i <= s.size(); ++i)
	{
		for(int j = 1; j <= t.size(); ++j)
		{
			if(s[i - 1] == t[j - 1])
				dp[i][j] = 1 + dp[i - 1][j - 1];
			else
				dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
		}
	}
	int i = s.size(), j = t.size();
	string lcs;
	while(i && j)
	{
		if(s[i - 1] == t[j - 1])
		{
			lcs = s[i - 1] + lcs;
			--i;
			--j;
		}
		else if(dp[i - 1][j] > dp[i][j - 1])
			--i;
		else
			--j;
	}
	cout << lcs;
	return 0;
}