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