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 a,b;
cin>>a>>b;
int n=a.length();
int m=b.length();
int dp[n+5][m+5];
memset(dp,0,sizeof(dp));
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
{if(a[i-1]==b[j-1])
dp[i][j]=1+dp[i-1][j-1];
dp[i][j]=max(dp[i][j],max(dp[i-1][j],dp[i][j-1]));
}
int x=dp[n][m];
vector<char>v;
int i=n,j=m;
while(i>0&&j>0)
{
     if(a[i-1]==b[j-1])
   { v.push_back(a[i-1]),j--,i--;
     continue;
    }

      if(dp[i-1][j]>dp[i][j-1])
         i--;
  else 
   j--;
}
for(int i=v.size()-1;i>=0;i--)
cout<<v[i];
cout<<endl;
}