Common permutation#2040
Given two strings and consisting of lowercase letters, find the longest string that can be obtained as a subsequence of a permutation of and as a subsequence of a permutation of .
The input consists of several test cases. Each test case contains two strings: the first line contains , and the second line contains . Each string is on a separate line and consists of at most lowercase letters.
For each test case, print the string on a separate line. If there are multiple possible , print the lexicographically smallest one.
Example 1