Two strings#5250
You are given two strings, each of length at most . A string is called good if, when repeated sufficiently many times, the resulting string contains both given strings as substrings. For example, consider the strings ababa and bab. The string ab is good, because repeating it twice yields ababab, which contains both given strings as substrings.
Your task is to find the shortest good string for the two provided strings.
The input consists of two strings. Both strings consist of characters with ASCII codes from to . The length of each string does not exceed .
Print the shortest good string. If there are multiple shortest good strings, you may output any one.
Example 1