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);
		String s = in.nextLine();
		String t = in.nextLine();
		System.out.println(check(s, t));
	}
	public static String check(String s, String t){
		if(s.length() == 0 || t.length() == 0) return "";
		int m = s.length();
		int n = t.length();
		int[][] dp = new int[m+1][n+1];
		for (int i = 1; i <= m; i++) {
			for (int j = 1; j <= n; 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]);
			}
		}
		int i = m, j = n;
		StringBuilder sb = new StringBuilder();
		while(i >= 1 && j >= 1){
			if(dp[i][j] == dp[i][j-1]) j--;
			else if(dp[i][j] == dp[i-1][j]) i--;
			else {
				sb.append(s.charAt(i-1));
				i--;
				j--;
			}
		}
		return sb.reverse().toString();
	}
}