def sfp(m,t):

j = 0

k = 0

while True:

# poprawa przejrzystości rozwiązania

if t[k] == m[j]:

j = j+1

k = k+1

else:

k = k - j +1

j = 0

if k == len(t) or j == len(m):

break

if j == len(m):

return k - j

else:

return -1

def sfp(m,t):

j = 0

k = 0

while True:

if t[k] == m[j]:

j = j+1

k = k+1

else:

k = k - j +1

j = 0

if k == len(t) or j == len(m):

break

if j == len(m):

return k - j

else:

return -1