String merging#9407
Given two strings and .
Find a string that contains both and as substrings and has the minimum possible length among all such strings.
A substring of a string is a consecutive subsequence of its characters. For example, the string is a substring of kbtu~open, while the string is not its substring.
The first line contains the string (1 \le |A| \le 10^5).
The second line contains the string (1 \le |B| \le 10^5).
It is guaranteed that both strings contain only lowercase Latin letters.
Output the string .
Example 1
Example 2
Example 3