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 f[3005][3005];

int main() {
	string s, t; cin >> s >> t;
	int n = s.size(), m = t.size();
	s = '$' + s; t = '$' + t;
	for (int i = 1; i <= n; i++)
	for (int j = 1; j <= m; j++) {
		if (s[i] == t[j]) f[i][j] = f[i - 1][j - 1] + 1;
		else f[i][j] = max(f[i - 1][j], f[i][j - 1]);
	}
	int i = n, j = m;
	string res;
	while (i && j) {
		if (s[i] == t[j]) {
			res += s[i];
			i--; j--;
		} else {
			if (f[i - 1][j] > f[i][j - 1]) i--;
			else j--;
		}
	}
	reverse(res.begin(), res.end());
	cout << res << '\n';
}