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 <iostream>
#include <algorithm>
#include <vector>
#include <string>

using namespace std;

int main() {
	string s, t; cin >> s >> t;
	int S = s.size(), T = t.size();
	vector<vector<int> > dp(S + 1, vector<int>(T + 1));
	for (int i = 1; i <= S; ++i) {
		for (int j = 1; j <= T; ++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 (S && T) {
		if (dp[S][T] == dp[S - 1][T]) S--;
		else if (dp[S][T] == dp[S][T - 1]) T--;
		else {
			ans = s[S - 1] + ans;
			S--, T--;
		}
	}
	cout << ans << endl;

	return 0;
}