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;
int lcs[3030][3030]; // lcs[i][j] lcs from s[0...i-1] to t[0...j-1]
string s,t;

int main(){
	memset(lcs,0,sizeof(lcs));
	cin>>s>>t;
	for(int i=1;i<=s.size();i++){
		for(int j=1;j<=t.size();j++){
			if(s[i-1]==t[j-1])
				lcs[i][j]=1+lcs[i-1][j-1];
			else
				lcs[i][j]=max(lcs[i-1][j],lcs[i][j-1]);

		}
	}
	int l,r;
	l=s.size(),r=t.size();
	string ret="";
	while(lcs[l][r]>0){
		while(lcs[l-1][r]==lcs[l][r])l--;
		
		while(lcs[l][r-1]==lcs[l][r])r--;

		ret+=t[r-1];
		l--;
		r--;
	}
	reverse(ret.begin(),ret.end());
	cout<<ret<<"\n";

    return 0;
}