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>
#define mx 3005
using namespace std;

string s, t, ans;
int dp[mx][mx], u, w;

int main(){
	cin >> s >> t;
	u = s.length();
	w = t.length();
	s = "." + s;
	t = "," + t;
	for(int i = 1; i <= u; i++){
		for(int j = 1; j <= w; j++){
			dp[i][j] = max(max(dp[i-1][j], dp[i][j-1]), dp[i-1][j-1] + (s[i] == t[j]));
		}
	}
	while(dp[u][w]){
		if(dp[u][w] == dp[u][w-1]) w--;
		else if(dp[u][w] == dp[u-1][w]) u--;
		else{
			ans = s[u] + ans;
			w--;
			u--;
		}
	}
	cout << ans << endl;
}