You are given a string of length $n$ . For every integer between $1 \ldots n$ you need to print the number of distinct substrings of that length.
The only input line has a string of length $n$ that consists of characters a–z.
For each integer between $1 \ldots n$ print the number of distinct substrings of that length.