KMP字符串匹配

def solve(____):
    text = str(____).strip()
    pattern = str(____).strip()
    def kmp(____):
        if not p: return ____
        n, m = len(____), len(____)
        fail = [____] * m
        j = ____
        for i in range(____, m):
            while j > ____ and p[i] != p[j]:
                j = fail[j-____]
            if p[i] == p[j]:
                j += ____
            fail[i] = j
        j = ____
        for i in range(____):
            while j > ____ and t[i] != p[j]:
                j = fail[j-____]
            if t[i] == p[j]:
                j += ____
            if j == m:
                return i - m + ____
        return -____
    idx = kmp(____)
    print(____)