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;
  int n=s.size(),m=t.size();
  vector<vector<int>>dp(n+1,vector<int>(m+1,0));
  for(int i=1;i<=n;i++){
    for(int j=1;j<=m;j++){
      if(s.at(i-1)==t.at(j-1))dp.at(i).at(j)=dp.at(i-1).at(j-1)+1;
      else dp.at(i).at(j)=max(dp.at(i).at(j-1),dp.at(i-1).at(j));
    }
  }
  int i=n,j=m;string LCS;
  while(LCS.size()<dp.at(n).at(m)){
    if(dp.at(i).at(j)==dp.at(i-1).at(j))i--;
    else if(dp.at(i).at(j)==dp.at(i).at(j-1))j--;
    else{LCS=s.at(i-1)+LCS;i--;j--;}
  }
  cout<<LCS<<endl;
}