#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

using cd = complex<double>;
const double pi = acos(-1);

int reverse(int num, int lg_n) {
    int res = 0;
    for (int i = 0; i < lg_n; i++) {
        if (num & (1 << i)) {
            res |= 1 << (lg_n - 1 - i);
        }
    }
    return res;
}

void fft(vector<cd> & a, bool invert){ 
    int n = a.size();
    int lg_n = 0;
    while ((1 << lg_n) < n) {
        lg_n++;
    }
    for (int i = 0; i < n; i++) {
        if (i < reverse(i, lg_n)) {
            swap(a[i], a[reverse(i, lg_n)]);
        }
    }
    for (int len = 2; len <= n; len <<= 1) {
        double ang = 2 * pi / len * (invert ? -1 : 1);
        cd wlen(cos(ang), sin(ang));
        for (int i = 0; i < n; i += len) {
            cd w(1);
            for (int j = 0; j < len/2; j++) {
                cd u = a[i+j];
                cd v = a[i+j+len/2] * w;
                a[i+j] = u+v;
                a[i+j+len/2] = u-v;
                w *= wlen;
            }
        }
    }
    if (invert) {
        for (cd & x : a) {
            x /= n;
        }
    }
}

vector<ll> multiply(vector<ll> const & a, vector<ll> const & b) {
    vector<cd> fa(a.begin(), a.end()), fb(b.begin(), b.end());
    int n = 1;
    while (n < a.size() + b.size()) n <<= 1;
    fa.resize(n);
    fb.resize(n);

    fft(fa, false);
    fft(fb, false);
    for (int i = 0; i < n; i++) {
        fa[i] *= fb[i];
    }
    fft(fa, true);

    vector<ll> result(n);
    for (int i = 0; i < n; i++) {
        result[i] = round(fa[i].real());
    }
    return result;
}

int main() {
    string s;
    cin >> s;
    int n = s.size();
    vector<ll> s1(n), s2(n);
    for (int i = 0; i < s.size(); i++) {
        s1[i] = (s[i] == 'B') ? 1 : 0;
    }
    for (int i = 0; i < s.size(); i++) {
        s2[i] = (s[i] == 'A') ? 1 : 0;
    }
    reverse(s2.begin(), s2.end());
    vector<ll> ret = multiply(s1, s2);
    for (int i = n -2; i >= 0; i--) {
        cout << ret[i] << endl;
    }
    return 0;
}