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 <iostream>
#include <algorithm>
#define INF 1000000013
using namespace std;
typedef long long ll;
string dp[2][3010];

int main(){
  string s,t;
  cin >> s >> t;
  int n=s.size(),m=t.size();
  for(int i=1;i<=n;i++){
    for(int j=1;j<=m;j++){
      int ki=i&1,ni=ki^1;
      if(dp[ni][j].size()>dp[ki][j-1].size()) dp[ki][j]=dp[ni][j];
      else dp[ki][j]=dp[ki][j-1];
      if(s[i-1]==t[j-1]){
        dp[ki][j]=dp[ni][j-1]+s[i-1];
      }
    }
  }
  cout << dp[n&1][m] << endl;
}