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 dp[3005][3005];

void output(int i, int j) {
  if (i == 0 || j == 0) return;
  if (S[i-1] == T[j-1]) {
    output(i-1, j-1);
    cout << S[i-1];
  } else {
    if (dp[i][j-1] <= dp[i-1][j]) output(i-1, j);
    else output(i, j-1);
  }
}

int main() {
  cin >> S >> T;
  int 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] = dp[i][j] + 1;
      else dp[i+1][j+1] = max(dp[i][j+1], dp[i+1][j]);
    }
  }
  output(N, M);
  cout << endl;
}