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 maxn = 3e3+10;
char a[maxn],b[maxn];
int dp[maxn][maxn];

int main() {
	scanf("%s",a+1);
	scanf("%s",b+1);
	int lena = strlen(a+1);
	int lenb = strlen(b+1);
	
	for(int i = lena;i >= 1;i--) {
		for(int j = lenb;j >= 1;j--) {
			if(a[i] == b[j]) 
				dp[i][j] = dp[i+1][j+1] +1;
			else 
				dp[i][j] = max(dp[i+1][j],dp[i][j+1]);
		}
	}
	
	int l = 1,r = 1;
	while(l <= lena && r <= lenb) {
		if(a[l] == b[r]) {
			cout<<a[l];
			l++;
			r++;
		}
		else if(dp[l][r] == dp[l+1][r]) l++;
		else r++;
	}
	return 0;
}