PROGRAMMING:Longest public Prefix suffix
The prefix of a string refers to all consecutive substrings starting with the first character that do not contain the last character; Suffixes refer to all consecutive substrings ending with the last character that do not contain the first character. For example, for the string 'abacab', its prefix is' a ','ab','aba ','abac','abacab ', and its suffix is' bacaba','acaba ','caba','aba ','ba','a '. The longest public prefix is' ABA '. In this paper, we give a string $$s $$with the length of $$n $$. For each $$M $$($$0 < = m < n $$), we find the longest common prefix of the continuous substring $$s [0.. M] $.
###Input format:
The input data has only one line and contains a string of letters A-Z with a length of no more than $$100, 000 $.
###Output format:
For each $$M $$($$0, 1, 2,..., N - 1 $), output the corresponding longest public prefix length, separated by spaces, and there must be no extra spaces at the end of the line.
###Input example:
```in
abcdabcdabce
```
###Output example:
```out
0 0 0 0 1 2 3 4 5 6 7 0
```
answer：If there is no answer, please comment
###Input format:
The input data has only one line and contains a string of letters A-Z with a length of no more than $$100, 000 $.
###Output format:
For each $$M $$($$0, 1, 2,..., N - 1 $), output the corresponding longest public prefix length, separated by spaces, and there must be no extra spaces at the end of the line.
###Input example:
```in
abcdabcdabce
```
###Output example:
```out
0 0 0 0 1 2 3 4 5 6 7 0
```
answer：If there is no answer, please comment