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

class Main {

    String s;
    String t;

    private void run() {

        Scanner sc = new Scanner(System.in);
        s = sc.next();
        t = sc.next();

        int S = s.length();
        int T = t.length();

        int[][] dp = new int[S+1][T+1];
        int[][] dpstr = new int[S+1][T+1];
        // 0 is diagonal
        // 1 is up
        // 2 is left

        for (int i = 0; i <= S; i++) {
            for (int j = 0; j <= T; j++) {
                if (i == 0 || j == 0) dp[i][j] = 0;
                else if (s.charAt(i-1) == t.charAt(j-1)) {
                    dpstr[i][j] = 0;
                    dp[i][j] = dp[i-1][j-1] + 1;
                } else if (dp[i-1][j] > dp[i][j-1]) {
                    dpstr[i][j] = 1;
                    dp[i][j] = dp[i-1][j];
                } else {
                    dpstr[i][j] = 2;
                    dp[i][j] = dp[i][j-1];
                }
            }
        }

        StringBuilder sb = new StringBuilder();
        int i = S, j = T;
        while (i != 0 && j != 0) {
            if (dpstr[i][j] == 0) {
                sb.append(s.charAt(i-1));
                i--;
                j--;
            } else if (dpstr[i][j] == 1)
                i--;
            else
                j--;
        }

        System.out.println(sb.reverse());
    }


    public static void main(String[] args) {
        Main solver = new Main();
        solver.run();
    }
}