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;

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

int main()
{
	cin >> s >> t;
	s = "@" + s;
	t = "#" + t;
	
	int n = s.size() - 1;
	int m = t.size() - 1;
	
	for(int i = 1; i <= n; i++)
		for(int j = 1; j <= m; j++)	
			if(s[i] == t[j])
				dp[i][j] = dp[i - 1][j - 1] + 1;
			else 
				dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
	
	while(n > 0 and m > 0)
	{
		if(dp[n][m] == dp[n - 1][m])
			n--;
		else if(dp[n][m] == dp[n][m - 1])
			m--;
		else
			ans.push_back(t[m]), n--, m--;		
		
	}
	reverse(ans.begin(), ans.end());
	
	cout << ans << '\n';

	return 0;
}