#include <bits/stdc++.h>
using namespace std;
char s[300005], v[300005];
int ap[300005][26], pos[27], len[26], n;
long long sol[27];
void solve(int idx) {
  int nr = 0;
  for (int i = 0; i < 26; ++i) {
    int st = 1, dr = len[i], ans = n + 1;
    while (st <= dr) {
      int mij = (st + dr) / 2;
      if (ap[mij][i] >= idx)
        ans = ap[mij][i], dr = mij - 1;
      else
        st = mij + 1;
    }
    if (ans <= n) ++nr, pos[nr] = ans;
  }
  sort(pos + 1, pos + nr + 1);
  for (int i = 1; i <= nr; ++i)
    if (i < nr)
      sol[i] += pos[i + 1] - pos[i];
    else
      sol[i] += n - pos[i] + 1;
}
int main() {
  int i, nr = 0;
  cin.get(s, 300005);
  cin.get();
  n = strlen(s);
  for (i = 1; i <= n; ++i)
    v[i] = s[i - 1], ++len[v[i] - 'a'], ap[len[v[i] - 'a']][v[i] - 'a'] = i;
  for (i = 0; i < 26; ++i)
    if (len[i] > 0) ++nr;
  for (i = 1; i <= n; ++i) solve(i);
  cout << nr << '\n';
  for (i = 1; i <= nr; ++i) cout << sol[i] << '\n';
  return 0;
}
