You are given two strings a and b. Find shortest string which being repeated infinitely contains the both strings. I.e. find such shortest s that infinite string ss... s... contains a and contains b as a substring.
- $$$1 \le Number of Test Cases \le 100$$$
- $$$1 \le len(a) \le 10000$$$
- $$$1 \le len(b) \le 10000$$$
This problem is not from an ongoing contest. Those who have access to the group (Brazil ICPC Summer School 2018) can view it here!