LCS-2#4260

LCS-2

1 second
128 megabytes
Very easy

Find the Longest Common Subsequence of two strings.

Input

Two strings consisting only of lowercase English letters. The length of each string does not exceed characters.

Output

Print the longest common subsequence of two strings.

Examples

Example 1

Loading
Loading

Example 2

Loading
Loading