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 main()
{
	
	string s, t;
	cin >> s >> t;

	int n = s.length(), m = t.length();

	vector<vector<int>> dp(n + 1, vector<int>(m + 1));

	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]);
		}
	}

	string ans = "";


	while(n > 0 && m > 0)
	{
		if(s[n - 1] == t[m - 1])
		{
			ans = s[n - 1] + ans;
			n--;
			m--;
		}
		else if(dp[n - 1][m] > dp[n][m - 1])
			n--;
		else
			m--;
	}

	cout << ans << endl;
}