String diversity is the number of symbols that occur in the string at least once. Diversity of *s* will be denoted by *d*(*s*). For example , *d*("aaa")=1, *d*("abacaba")=3.

Given a string *s*, consisting of lowercase Latin letters. Consider all its substrings. Obviously, any substring diversity is a number from 1 to *d*(*s*). Find statistics about substrings diversity: for each *k* from 1 to *d*(*s*), find how many substrings of *s* has a diversity of exactly *k*.
The input consists of a single line containing *s*. It contains only lowercase Latin letters, the length of *s* is from 1 to 3·10<sup class="upper-index">5</sup>.
s = input()
p = [-1] * 26
ans = [0] * 26

for i in range(len(s)):
    p[ord(s[i]) - ord('a')] = i
    x = p[:]
    x.append(-1)
    x.sort()
    
    for i in range(1, 27):
        ans[26 - i] += x[i] - x[i - 1]

while ans[-1] <= 0:
    ans.pop()

print(len(ans))
for x in ans:
    print(x)