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 <cstdio>
#include <algorithm>
using namespace std;
char s[3010], t[3010], a[3010];
int dp[3010][3010];
int main() {
	int i, j;
	scanf("%s%s", s, t);
	for (i = 0; s[i]; i++) {
		for (j = 0; t[j]; j++) {
			dp[i+1][j+1] = max(dp[i+1][j], dp[i][j+1]);
			if (s[i] == t[j]) dp[i+1][j+1] = max(dp[i+1][j+1], dp[i][j] + 1);
		}
	}
	while (i && j) {
		if (dp[i][j] == dp[i-1][j-1] + 1 && s[i-1] == t[j-1]) {
			--i; --j;
			a[dp[i][j]] = s[i];
		} else if (dp[i][j] == dp[i-1][j]) {
			--i;
		} else {
			--j;
		}
	}
	puts(a);
	return 0;
}