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 <bits/stdc++.h>
using namespace std;

int main(){
	string a;
	string b;
	cin>>a>>b;
	int n=a.size();
	int m=b.size();
	int dp[n+1][m+1];
	for(int i=0;i<=n;i++)
	{
		for(int j=0;j<=m;j++)
		{
			if(!i||!j)dp[i][j]=0;
			else if(a[i-1]==b[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 i = n, j = m; 
    while (i > 0 && j > 0) 
    {
	    if (a[i-1] == b[j-1]) 
	    { 
		    ans=a[i-1]+ans;
		    i--; j--;   
	    }
	    else if (dp[i-1][j] > dp[i][j-1])i--; 
	    else j--; 
    }
	cout<<ans;
	return 0;
}