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 mod = 1e9+7;
int dp[3002][3002];
int main()
{
	string s,t;
	cin>>s>>t;
	int n = s.size(),m = t.size();
	for (int i = 0; i < n; ++i)
	{
		for(int j = 0; j < m; j++){
			if(s[i] == t[j]) {
				dp[i + 1][j + 1] = 1 + dp[i][j];
			}
			else {
				dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]);
			}
		}
	}
	int i = n,j = m;
	string s1 = "";
	while(i > 0 && j > 0) {
		if(s[i - 1] == t[j - 1]) {
			s1 += s[i - 1];
			i--,j--;
		}
		else if(dp[i][j] == dp[i - 1][j]) {
			i--;
		}
		else j--;
	}
	reverse(s1.begin(), s1.end());
	cout << s1;
	return 0;
}