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<string>
#include<vector>
using namespace std;
int main(){
    string s,t;
    cin>>s>>t;

    vector<vector<char> > f(t.length()+1);
    vector<vector<char> > g(t.length()+1);
    
    for(int i=0;i<s.length();i++){
	for(int j=0;j<t.length();j++){
	    if(s[i]==t[j]){
		g[j+1]=f[j];
		g[j+1].push_back(s[i]);
	    }
	    else{
		if(f[j+1].size()>g[j].size())
		    g[j+1]=f[j+1];
		else
		    g[j+1]=g[j];
	    }
	}
	g.swap(f);
    }
    for(int i=0;i<f[t.length()].size();i++)
	cout<<f[t.length()][i];
    cout<<endl;

    
    return 0;
}