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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        char[] inputS = br.readLine().toCharArray();
        char[] inputT = br.readLine().toCharArray();

        int m = inputS.length;
        int n = inputT.length;
        int dp[][] = new int[m + 1][n + 1];
        for (int i = 0; i <= n; i++) dp[0][i] = 0;
        for (int j = 0; j <= m; j++) dp[j][0] = 0;
        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if (inputS[i - 1] == inputT[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]);
                }
            }
        }
        StringBuilder sb = new StringBuilder();
        while(m > 0 &&  n > 0) {
            if (inputS[m - 1] == inputT[n - 1]){
                sb.append(inputS[m - 1]);
                m--;n--;
            }
            else if (dp[m][n - 1] > dp[m - 1][n]) n--;
            else m--;
        }
        System.out.println(sb.reverse());
    }
}