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 sc = new Scanner(System.in);
        String s = sc.next();
        String t = sc.next();

        System.out.println(solve(s, t));

    }

	private static String solve(String s, String t) {

		int sLength = s.length();
		int tLength = t.length();

		int[][] dp = new int[sLength+1][tLength+1];

		for(int i = 1; i <= sLength; i++) {
			for(int j = 1; j <= tLength; j++) {
				if(s.charAt(i-1) == t.charAt(j-1))
					dp[i][j] = dp[i-1][j-1]+1;

				dp[i][j] = Math.max(dp[i-1][j], dp[i][j]);
				dp[i][j] = Math.max(dp[i][j-1], dp[i][j]);
			}
		}

		String re="";

		int i = sLength, j = tLength;
		while(dp[i][j] != 0) {
			if(dp[i][j] == dp[i-1][j]) {
				i--;
			}else if(dp[i][j] == dp[i][j-1]) {
				j--;
			}else {
				re = s.charAt(i-1) + re;
				i--;
				j--;
			}
		}

		return re;

	}
}