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;
const int N = 3e3 + 10;
int dp[N][N],n,m;
char a[N],b[N];
int main(){
  scanf("%s%s",a+1,b+1);
  n = strlen(a+1), m = strlen(b+1);
  for(int i = 1; i <= n; ++i){
  	for(int j = 1; j <= m; ++j){
    	if(a[i]==b[j])dp[i][j] = 1+dp[i-1][j-1];
        else dp[i][j] = max(dp[i-1][j],dp[i][j-1]);
    }
  }
  vector<char> ans;
  int i = n, j = m;
  while(i > 0 && j > 0){
  	if(a[i] == b[j])ans.emplace_back(a[i--]),j--;
    else if(dp[i-1][j] > dp[i][j-1])i--;
    else j--;
  }
  reverse(ans.begin(),ans.end());
  for(char &i: ans)printf("%c",i);
  return 0;
}