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();
		int[][] dp = new int[s.length() + 3][t.length() + 3];
		for(int i = 0 ; i < s.length() ; i++) {
			for(int j = 0 ; j < t.length() ; j++){
				if(s.charAt(i) == t.charAt(j)) {
					dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1],dp[i][j] + 1);
				}
				dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1],dp[i][j + 1]);
				dp[i + 1][j + 1] = Math.max(dp[i + 1][j + 1],dp[i + 1][j]);
			}
		}
		String ans = "";
		StringBuilder sb = new StringBuilder(ans);
 
		int i = s.length();
		int j = t.length();
 
		while(i > 0 && j > 0) {
			if(dp[i][j] == dp[i - 1][j])
				i--;
			else if(dp[i][j] == dp[i][j - 1])
				j--;
			else {
				sb.append(s.charAt(i - 1));
				i--;
				j--;
			}
 
		}
		System.out.println(sb.reverse().toString());
 
	}
}