D. Prefixes and Suffixes（KMP+dp）

参考博客：https://blog.csdn.net/huanghongxun/article/details/53209004
题目链接：http://codeforces.com/problemset/problem/432/D

You have a string s = s1s2…s|s|, where |s| is the length of string s, and si its i-th character.

Let’s introduce several definitions:
A substring s[i…j] (1 ≤ i ≤ j ≤ |s|) of string s is string sisi + 1…sj.
The prefix of string s of length l (1 ≤ l ≤ |s|) is string s[1…l].
The suffix of string s of length l (1 ≤ l ≤ |s|) is string s[|s| - l + 1…|s|].

Your task is, for any prefix of string s which matches a suffix of string s, print the number of times it occurs in string s as a substring.
Input

The single line contains a sequence of characters s1s2…s|s| (1 ≤ |s| ≤ 105) — string s. The string only consists of uppercase English letters.<