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.Scanner;


public class Main {
    public static void main(String[] args)
    {
        Scanner in = new Scanner(System.in);
        char[] arr1 = in.nextLine().toCharArray();
        char[] arr2 = in.nextLine().toCharArray();
        in.close();
        StringBuilder sb = new StringBuilder();
        int len1 = arr1.length, len2 = arr2.length, maxl = 0;
        
        int[][] dp = new int[len1+1][len2+1];

        
        for(int i = 1; i <= len1; i++)
        {
            for(int j = 1; j <= len2; j++)
            {
                if(arr1[i-1] == arr2[j-1])
                {   
                    dp[i][j] = 1 + dp[i-1][j-1];
                }
                else{
                    dp[i][j] = Math.max(dp[i][j-1], dp[i-1][j]);
                }
            }

        }
        //TO DO: constructing the path
        while(dp[len1][len2] > 0){
            if(arr1[len1-1] == arr2[len2-1]){
                sb.append(arr1[len1-1]);
                len1--;
                len2--;
            }
            else{
                if(dp[len1][len2] == dp[len1][len2-1]){
                    len2--;
                }
                else{
                    len1--;
                }
            }
        }
        System.out.println(sb.reverse().toString());
    }
}