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.*;
 
public class Main{
  public static void main(String[]args){
    Scanner sc =  new Scanner(System.in);
    String s = sc.nextLine();
    String t = sc.nextLine();
    int S = s.length();
    int T = t.length();
    int[][] dp = new int[S+1][T+1];
    
    for(int i = 0; i <= S; i++){
      for(int j = 0; j <= T; j++){
        if(i == 0 || j == 0){
          dp[i][j] = 0;
        }else if(s.charAt(i-1) == t.charAt(j-1)){
          dp[i][j] = Math.max(dp[i][j], dp[i-1][j-1]+1);
        }else{
          dp[i][j] = Math.max(dp[i][j], dp[i-1][j]);
          dp[i][j] = Math.max(dp[i][j], dp[i][j-1]);
        }
      }
    }
    int i = S;
    int j = T;
    String ans = "";
    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{
        ans = String.valueOf(s.charAt(i-1)) + ans;
        i--;
        j--;
      }
    }
    System.out.println(ans);
  }
}