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()
d = len(set(s))
divDict = [0] * (d + 1)
for i in range(len(s)):
    letters = set()
    for j in range(i, len(s)):
        if s[j] not in letters:
            letters.add(s[j])
            if len(letters) == d:
                divDict[len(letters)] += len(s) - j
                break
        divDict[len(letters)] += 1

# Print the output.
print(d)
for i in range(1, d + 1):
    print(divDict[i])
