Openjudge: maximum span of string

describe

There are three strings S,S1,S2, among ,S Length not exceeding 300,S1 and S2 Not more than 10. Want to test S1 and S2 Whether at the same time S It appears that , And S1 be located S2 Left side , And in S They don't cross each other （ namely ,S1 The right boundary point of is S2 On the left side of the boundary point ）. Calculate the maximum span that meets the above conditions （ namely , Maximum separation distance ： Far right S2 The starting point of is the same as the leftmost S1 The number of characters between the endpoints of ）. If there is no one that meets the conditions S1,S2 There is , The output -1.

for example ,S = "abcd123ab888efghij45ef67kl", S1="ab", S2="ef", among ,S1 stay S In the 2 Time ,S2 Also in the S In the 2 Time , The maximum span is ：18.

Input

Three strings ：S, S1, S2, Separated by commas （ Be careful ,S, S1, S2 No commas or spaces in ）;

Output

S1 and S2 stay S Maximum span ; If in S There's nothing that satisfies the condition in S1 and S2, The output -1.

The sample input

abcd123ab888efghij45ef67kl,ab,ef

Sample output

18

Code

s = input().split(',')
a = s[0]
b = s[1]
c = s[2]
if b in a and c in a:
    x = a.find(b)
    y = a.rfind(c)
    if x >= y:
        print('-1')
    else:
        print(y-x-len(b))
else:
    print('-1')