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 main(){
	string s,t;
	cin>>s>>t;
	vector<vector<int>> dp(s.size()+1,vector<int>(t.size()+1,0));//dp[i][j] sのi文字目、tのj文字目まで
	for(int i=1;i<=s.size();i++){
		for(int j=1;j<=t.size();j++){
			if(s[i-1]==t[j-1]){
				dp[i][j]=dp[i-1][j-1]+1;
			}
			else{
				dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
			}
		}
	}
	string ans = "";
	int x=s.size(),y=t.size();
	while(x>0&&y>0){
		if(dp[x][y]==dp[x-1][y])x--;
		else if(dp[x][y]==dp[x][y-1])y--;
		else{
			ans=t[y-1]+ans;
			x--;y--;
		}
	}
	
	cout<<ans<<endl;
	
	return 0;
}