B'Palindromic characteristics of string s with length |s| is a sequence of |s| integers, where k-th number is the total number of non-empty substrings of s which are k-palindromes. A string is 1-palindrome if and only if it reads the same backward as forward. A string is k-palindrome (k xe2 x80 x89> xe2 x80 x891) if and only if: The left half of string t is its prefix of length xe2 x8c x8a|t| xe2 x80 x89/ xe2 x80 x892 xe2 x8c x8b, and right half -- the suffix of the same length. xe2 x8c x8a|t| xe2 x80 x89/ xe2 x80 x892 xe2 x8c x8b denotes the length of string t divided by 2, rounded down. Note that each substring is counted as many times as it appears in the string. For example, in the string "aaa" the substring "a" appears 3 times. The first line contains the string s (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89|s| xe2 x80 x89 xe2 x89 xa4 xe2 x80 x895000) consisting of lowercase English letters. Print |s| integers -- palindromic characteristics of string s. In the first example 1-palindromes are substring xc2 xaba xc2 xbb, xc2 xabb xc2 xbb, xc2 xabb xc2 xbb, xc2 xaba xc2 xbb, xc2 xabbb xc2 xbb, xc2 xababba xc2 xbb, the substring xc2 xabbb xc2 xbb is 2-palindrome. There are no 3- and 4-palindromes here. '...