Problem: 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.

Input

The input consists of a single line containing s. It contains only lowercase Latin letters, the length of s is from 1 to 3·105.

Output

Print to the first line the value d(s). Print sequence t1, t2, ..., td(s) to the following lines, where ti is the number of substrings of s having diversity of exactly i.

Examples

Input

abca


Output

3
4
3
3


Input

aabacaabbad


Output

4
14
19
28
5

Note

Consider the first example.

We denote by s(i, j) a substring of "abca" with the indices in the segment [i, j].

  * s(1, 1) =  "a", d("a") = 1
  * s(2, 2) =  "b", d("b") = 1
  * s(3, 3) =  "c", d("c") = 1
  * s(4, 4) =  "a", d("a") = 1
  * s(1, 2) =  "ab", d("ab") = 2
  * s(2, 3) =  "bc", d("bc") = 2
  * s(3, 4) =  "ca", d("ca") = 2
  * s(1, 3) =  "abc", d("abc") = 3
  * s(2, 4) =  "bca", d("bca") = 3
  * s(1, 4) =  "abca", d("abca") = 3



Total number of substring with diversity 1 is 4, with diversity 2 equals 3, 3 diversity is 3.

Solution (in JAVA):

Solution:
import java.io.InputStreamReader;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author sheep
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskC solver = new TaskC();
		solver.solve(1, in, out);
		out.close();
	}
}

class TaskC {
    public void solve(int testNumber, InputReader in, PrintWriter out) {
        char[] s = in.next().toCharArray();

        long[] answer = new long[27];
        int maxDiv = 0;
        outer: for (int div = 1; div <= 26; ++div) {
            int[] count = new int[26];
            int current = 0;
            int right = 0;
            int[] count2 = new int[26];
            int right2 = 0;
            int current2 = 0;
            for (int i = 0; i < s.length; ++i) {
                while (right < s.length && current <= div) {
                    ++count[s[right] - 'a'];
                    if (count[s[right] - 'a'] == 1) {
                        ++current;
                    }
                    if (current > div) {
                        --count[s[right] - 'a'];
                        --current;
                        break;
                    }
                    ++right;
                }
                while (right2 < s.length && current2 < div) {
                    ++count2[s[right2] - 'a'];
                    if (count2[s[right2] - 'a'] == 1) {
                        ++current2;
                    }
                    if (current2 >= div) {
                        --count2[s[right2] - 'a'];
                        --current2;
                        break;
                    }
                    ++right2;
                }
                if (current < div) continue outer;
                maxDiv = div;
                answer[div] += right - right2;

                --count[s[i] - 'a'];
                if (count[s[i] - 'a'] == 0) {
                    --current;
                }

                --count2[s[i] - 'a'];
                if (count2[s[i] - 'a'] == 0) {
                    --current2;
                }
            }
        }

        out.println(maxDiv);
        for (int i = 1; i <= maxDiv; ++i) {
            out.println(answer[i]);
        }
        out.println();
    }
}

class InputReader {
    BufferedReader reader;
    StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream));
        tokenizer = null;
    }

    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (Exception e) {
                throw new UnknownError();
            }
        }
        return tokenizer.nextToken();
    }

    }