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;
int s_s,t_s;
int dp[3010][3010];
string n;
int main(){
	cin>>s>>t;
	for(int i=0;i<s.size();++i){
		for(int j=0;j<t.size();++j){
			if(s[i]==t[j]) dp[i+1][j+1] = max(dp[i+1][j+1], dp[i][j]+1);
      		dp[i+1][j+1] = max(dp[i+1][j+1], dp[i+1][j]);
      		dp[i+1][j+1] = max(dp[i+1][j+1], dp[i][j+1]);
		}
	}
	s_s=s.size();
	t_s=t.size();
	while(s_s>0 && t_s){
		if(dp[s_s][t_s]==dp[s_s-1][t_s])s_s--;
		else if(dp[s_s][t_s]==dp[s_s][t_s-1])t_s--;
		else {
			n=s[s_s-1]+n;
      		s_s--;
      		t_s--;
		}
	}
	cout<<n<<endl;
	return 0;
}