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 dp[3001][3001];
int main()
{
	string s, t, ans = "\n";
	cin >> s >> t;	
	int m = s.length(), n = t.length();
	for(int i = 1; i <= m; ++i)
	{
		for(int j = 1; j <= n; ++j)
		{
			if(s[i - 1] == t[j - 1])
			{
				dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] + 1);
			}
			dp[i][j] = max(dp[i][j], max(dp[i - 1][j], dp[i][j - 1]));
		}
	}
	for(int x = m, y = n; x && y; )
	{
		if(dp[x][y] == dp[x - 1][y])
		{
			--x;
		}
		else if(dp[x][y] == dp[x][y - 1])
		{
			--y;
		}
		else
		{
			ans = s[x - 1] + ans;
			--x;
			--y;
		}
	}
	cout << ans;
}