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

dist = set(s)
print(len(dist))

resDict = dict()
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) in resDict:
                resDict[len(letters)] += 1
            else:
                resDict[len(letters)] = 1
        else:
            resDict[len(letters)] += 1

for val in sorted(resDict):
    print(resDict[val])