The Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a "word" within a main "text string" by employing the observation that when a mismatch occurs, the word itself embodies sufficient information to determine where the next match could begin, thus bypassing re-examination of previously matched characters.

Instructions:

1.Run the program Main.py.

2.Act In accordance with the instructions of the program.

3.Get result.