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