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>
#include <algorithm>
using namespace std;
typedef long long int ll;

int N,M;
int DP[3005][3005];
string A,B,C;

int main(){
	cin>>A>>B;
	N=A.size();
	M=B.size();
	for(int i=1;i<N+1;i++)
		for(int j=1;j<M+1;j++)
			if(A[i-1]==B[j-1])
				DP[i][j]=DP[i-1][j-1]+1;
			else
				DP[i][j]=max(DP[i][j-1],DP[i-1][j]);

	while(N!=0 and M!=0){
		if(A[N-1]==B[M-1]){
			C+=A[N-1];
			N--;
			M--;
		}
		else if(DP[N-1][M]>DP[N][M-1])
			N--;
		else
			M--;
	}

	reverse(C.begin(),C.end());
	cout<<C;

}