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;
string s,t,k="";
long long n,m,f[4000][4000];
int main(){
	cin>>s>>t;
	n=s.length();
	m=t.length();
	s=" "+s;t=" "+t;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(s[i]==t[j]){
				f[i][j]=f[i-1][j-1]+1;
			}else{
				f[i][j]=max(f[i-1][j],f[i][j-1]);
			}
		}
	}
	long long i1=n,j1=m;
	while(i1>0&&j1>0){
		if(f[i1][j1]==f[i1-1][j1]) i1--;
		else{
		    if(f[i1][j1]==f[i1][j1-1]) j1--;
		    else if(f[i1][j1]==f[i1-1][j1-1]+1){
			    k=s[i1]+k;
			    i1--;
			    j1--;
		    }
		}
	}
	cout<<k;
}