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 a,b;
int n,m;
int t[3003][3003];
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>a>>b;
	n=a.size();
	m=b.size();
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(a[i-1]==b[j-1]){
				t[i][j]=t[i-1][j-1]+1;
			}
			else{
				t[i][j]=max(t[i-1][j],t[i][j-1]);
			}
		}
	}
	stack<char>wyp;
	while(t[n][m]!=0){
			if(a[n-1]==b[m-1]){
				wyp.push(a[n-1]);
				n--;
				m--;
			}
			else{
				if(t[n-1][m]>t[n][m-1]){
					n--;
				}
				else{
					m--;
				}
			}
		}
	while(!wyp.empty()){
		cout<<wyp.top();
		wyp.pop();
	}
	return 0;
}