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;
long long dp[3010][3010];
int main(){

string s,t;
cin>>s>>t;
memset(dp,0,sizeof(dp));

int a =s.length();
int b = t.length();

for(int i =1;i<=a;i++){
  for(int j=1;j<=b;j++){
    if(s[i-1]==t[j-1]){
      dp[i][j]=max(dp[i][j],dp[i-1][j-1]+1);
    } else {
          dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
    }
  }
}
string ans="";
int i=a,j=b;
while(i>=1 && j>=1){
    if(s[i-1]==t[j-1]){
      ans=s[i-1]+ans;
      i--;
      j--;
    } else {
      if(dp[i-1][j]==dp[i][j]){
        i--;
      } else {
        j--;
      }
    }
  
}

cout<<ans;

   return 0;
}