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()

length = len(set(s))

p = [-1] * length
ans = [0] * length

for i in range(len(s)):
    p[ord(s[i]) - ord('a')] = i
    x = p.copy()
    x.append(-1)

    x.sort()

    #print(f"x: {x}")

    for j in range(1, length + 1):
        ans[length - j] += x[j] - x[j - 1]
    #print(f"{i}: {ans}")

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