PROGRAMMING:Maximum span of string

There are three strings S, S1 and S2, in which s is not more than 300 and S1 and S2 are not more than 10.
Now, we want to detect whether S1 and S2 appear in s at the same time, and S1 is on the left side of S2 and does not cross each other in S (that is, the right boundary point of S1 is on the left side of the left boundary point of S2).
Calculate the maximum span that meets the above conditions (i.e., the maximum spacing distance: the number of characters between the starting point of the rightmost S2 and the ending point of the leftmost S1).
If there is no S1 and S2 that meet the condition, output - 1.
For example, s = "abcd123ab888efghij45ef67kl", S1 = "ab", S2 = "EF", where S1 appears twice in s, S2 also appears twice in s, and the maximum span is 18.
###Input format:
Input a total of one line, including three strings S, S1, S2, separated by commas.
The data guarantees that there are no spaces and commas in the three strings.
###Output format:
Input a total of one line, including three strings S, S1, S2, separated by commas.
The data guarantees that there are no spaces and commas in the three strings.
###Input example:
```in
abcd123ab888efghij45ef67kl,ab,ef
```
###Output example:
```out
eighteen
```







answer：If there is no answer, please comment