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 scanner = new Scanner(System.in);

    char[] s = scanner.next().toCharArray();
    char[] t = scanner.next().toCharArray();

    int slen = s.length;
    int tlen = t.length;
    int[][] dp = new int[slen + 1][tlen + 1];
    for (int i = 1; i <= slen; i++) {
      for (int j = 1; j <= tlen; j++) {
        if (s[i - 1] == t[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();
    int i = slen;
    int j = tlen;
    while (i > 0 && j > 0) {
      if (dp[i][j] == dp[i - 1][j - 1] + 1 && s[i - 1] == t[j - 1]) {
        sb.append(s[i - 1]);
        i--;
        j--;
      } else if (dp[i][j] == dp[i - 1][j]) {
        i--;
      } else if (dp[i][j] == dp[i][j - 1]) {
        j--;
      } else {
        throw new IllegalStateException();
      }
    }
    System.out.println(sb.reverse().toString());
  }
}