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>
#define int long long
std::string dp[3][3005];
using namespace std;

signed main(){
  string s,t;cin>>s>>t;
  int S=s.size();int T=t.size();
  for(int i=1;i<=S;i++){
    for(int j=1;j<=T;j++){
      if(dp[0][j].size()<dp[1][j-1].size())dp[1][j]=dp[1][j-1];
      else dp[1][j]=dp[0][j];
      if(dp[0][j-1].size()==dp[1][j].size()&&s[i-1]==t[j-1])dp[1][j]=dp[0][j-1]+s[i-1];
    }
    for(int j=1;j<=T;j++)dp[0][j]=dp[1][j];
  }
  cout<<dp[1][T]<<endl;
}