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;
int dp[3005][3005],x,y;
string s,t,lcs;
int main(){
  cin>>s>>t;
  for(int i=1;i<=(int)s.size();i++){
    for(int j=1;j<=(int)t.size();j++){
      if(s[i-1]==t[j-1]) dp[i][j]=dp[i-1][j-1]+1;
      else dp[i][j]=max(dp[i-1][j],dp[i][j-1]);
    }
  }
  x=s.size();
  y=t.size();
  while(x>0 && y>0){
    if(s[x-1]==t[y-1]){
      lcs+=s[x-1];
      x--;
      y--;
    }else if(dp[x-1][y]>dp[x][y-1]) x--;
    else y--;
  }
  reverse(lcs.begin(),lcs.end());
  cout<<lcs;
  return 0;
}