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) {
        Problem.problemF_LCS();
    }
}

class Problem {
    static void problemF_LCS() {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();
        String t = sc.nextLine();
        int n = s.length(), m = t.length();
        int[][] DP = new int[n+1][m+1];
        for (int i = 1; i <= n ; i++) {
            for (int j = 1; j <= m; j++) {
                if (s.charAt(i-1) == t.charAt(j-1))
                    DP[i][j] = DP[i - 1][j - 1] + 1;
                else
                    DP[i][j] = Math.max(DP[i - 1][j], DP[i][j - 1]);
            }
        }

        // retrieve the string
        int i = n, j = m;
        StringBuilder ans = new StringBuilder();
        while (i > 0 && j > 0) {
            if (DP[i][j] == DP[i][j-1])
                j--;
            else if (DP[i][j] == DP[i-1][j])
                i--;
            else {
                ans.append(s.charAt(i-1));
                i--; j--;
            }
        }
        System.out.println(ans.reverse().toString());
    }

}