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>
using namespace std;
string S,T;
int dp[3010][3010] = {};

int main(){
	cin >> S >> T;
	int N = S.size(),M = T.size();
	for(int i=1;i<=N;i++){
		for(int j=1;j<=M;j++){
			if(S[i-1]==T[j-1]) dp[i][j] = max(dp[i][j],dp[i-1][j-1]+1);
			else dp[i][j] = max(dp[i][j-1],dp[i-1][j]);
		}
	}
	string ans = "";
	int a = N,b = M,res = dp[N][M];
	for(int i=N;i>=1;i--){
		for(int j=M;j>=1;j--){
			if(res-1==dp[i-1][j-1] && S[i-1]==T[j-1]){
				ans = S[i-1] + ans; res--; break;
			}
		}
	}
	cout << ans << endl;
}