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>
using namespace std;

int main() {
	string s,t,r="";
	cin>>s>>t;

	int x=s.length();
	int y=t.length();
	
	int dp[x+1][y+1];
	
	for(int i=0;i<=x;i++){
		for(int j=0;j<=y;j++){
			if(i==0||j==0)dp[i][j]=0;
			else{
				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]);
				}
			}
		}
	}
	int i=x,j=y;
	while(dp[i][j]!=0&&(i>=0&&j>=0)){
		if(dp[i][j]>max(dp[i-1][j],dp[i][j-1])){
			r=s[i-1]+r;
			i=i-1;
			j=j-1;
		}
		else{
			if(dp[i-1][j]>dp[i][j-1]){
				i=i-1;
			}
			else{
				j=j-1;
			}
		}
	}
	cout<<r;
	
	return 0;
}