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 JAVA):

Solution:
import java.util.*;
public class Main {
    public static void main(String args[]) {
       Scanner sc=new Scanner(System.in);
       String s=sc.next();
       String t=sc.next();
       int dp[][]=new int[s.length()+1][t.length()+1];
       for(int i=1;i<=s.length();i++)
       {
           for(int j=1;j<=t.length();j++)
           {
               if(s.charAt(i-1)==t.charAt(j-1))
               dp[i][j]=1+dp[i-1][j-1];
               else
               dp[i][j]=Math.max(dp[i-1][j],dp[i][j-1]);
           }
       }
       int m=s.length(),n=t.length();
       StringBuilder sb=new StringBuilder();
       while(m>0 && n>0)
       {
           if(s.charAt(m-1)==t.charAt(n-1))
           {
               sb.append(s.charAt(m-1));
               m--;
               n--;
           }
           else
           {
               if(dp[m-1][n]>dp[m][n-1])
               {
                   m=m-1;
                   n=n;
               }
               else
               {
                   m=m;
                   n=n-1;
               }
           }
       }
       System.out.println(sb.reverse().toString());
    }
}