You are given strings $s$ and $t$. Find one longest string that is a subsequence of both $s$ and $t$.

Notes

A subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.

Input is given from Standard Input in the following format:
$s\ t$

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.

s and t are strings consisting of lowercase English letters.
$1≤∣s∣,∣t∣≤3000$

axb

The answer is axb or ayb; either will be accepted.