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;
#define rep(i, n) for(int i = 0;i < (int)(n);i++)
int main() {
  string s, t, ans;cin >> s >> t;
  int m = s.size(), n = t.size();
  vector<vector<int>> dp(m+1, vector<int>(n+1, 0));
  rep(i, m) rep(j, n){
    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]);
  }
  int l = dp[m][n];
  m--;n--;
  while(l > 0){
    if(s[m] == t[n]){
      ans = s[m] + ans;
      m--;
      n--;
      l--;
    } else if(dp[m+1][n+1] == dp[m][n+1]) {
      m--;
    } else {
      n--;
    }
  }
  cout << ans << endl;
}