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;
string s, t;
int n, m;
long long dp[3005][3005];
int main(){
  cin >> s >> t;
  n = s.size();
  m = t.size();
  for(int i=0; i<n; i++){
    for(int j=0; j<m; j++){
      if(s[i]==t[j]) dp[i+1][j+1] = max({dp[i][j]+1, dp[i+1][j], dp[i][j+1]});
      else dp[i+1][j+1] = max(dp[i+1][j], dp[i][j+1]);
    }
  }
  n--;
  m--;
  stack<char> st;
  st.push('\n');
  while(n>=0 && m>=0){
    if(s[n]==t[m]){
      st.push(s[n]);
      n--;
      m--;
    }
    else if(dp[n][m+1]==dp[n+1][m+1]) n--;
    else m--;
  }
  while(!st.empty()){cout << st.top(); st.pop();}
}