#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
const ll INF = 1e9;
bool graph[nmax][nmax];
vector<vector<ll>> dist = vector<vector<ll>>(nmax, vector<ll>(nmax, INF));
void warshall_floyd(ll n)
{
    for (size_t i = 0; i < n; i++)
    {
        for (size_t j = 0; j < n; j++)
        {
            for (size_t k = 0; k < n; k++)
            {
                dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]);
            }
        }
    }
}

class UnionFind
{
public:
    vector<ll> Parent;

    UnionFind(ll N)
    {
        Parent = vector<ll>(N, -1);
    }
    ll find(ll A)
    {
        if (Parent[A] < 0)
            return A;
        return Parent[A] = find(Parent[A]);
    }

    ll size(ll A)
    {
        return -Parent[find(A)];
    }

    bool Union(ll A, ll B)
    {
        A = find(A);
        B = find(B);
        if (A == B)
        {
            return false;
        }
        if (size(A) < size(B))
            swap(A, B);

        Parent[A] += Parent[B];
        Parent[B] = A;

        return true;
    }
};

ll gcd(ll a, ll b)
{
    if (b == 0)
        return a;
    return gcd(b, a % b);
}

ll lcm(ll a, ll b)
{
    ll g = gcd(a, b);
    return a / g * b;
}

ll mulMod(ll a, ll b)
{
    return (((a % MOD) * (b % MOD)) % MOD);
}

ll powMod(ll a, ll p)
{
    if (p == 0)
    {
        return 1;
    }
    else if (p % 2 == 0)
    {
        ll half = powMod(a, p / 2);
        return mulMod(half, half);
    }
    else
    {
        return mulMod(powMod(a, p - 1), a);
    }
}

ll ceil(ll a, ll b)
{
    return (a + b - 1) / b;
}
void solve(std::string S)
{
    vector<ll> ans(S.size() + 1, 0);

    int R = 0;
    int L = 0;
    int cntR = 0;
    int cntL = 0;
    bool isR = true;

    for (int i = 0; i < S.size(); i++)
    {
        if (isR)
        {
            cntR++;
        }
        else
        {
            cntL++;
        }
        if (S[i] == 'R' && S[i + 1] == 'L')
        {
            R = i;
            L = i + 1;
            isR = false;
        }

        if ((S[i] == 'L' && S[i + 1] == 'R'))
        {
            int A = 0;
            int B = 0;
            if (cntR % 2 != 0)
            {
                A += cntR / 2 + 1;
                B += cntR / 2;
            }
            else
            {
                A += cntR / 2;
                B += cntR / 2;
            }

            if (cntL % 2 != 0)
            {
                A += cntL / 2;
                B += cntL / 2 + 1;
            }
            else
            {
                A += cntL / 2;
                B += cntL / 2;
            }
            ans[R] = A;
            ans[L] = B;
            cntR = 0;
            cntL = 0;
            isR = true;
        }
    }
    int A = 0;
    int B = 0;
    if (cntR % 2 != 0)
    {
        A += cntR / 2 + 1;
        B += cntR / 2;
    }
    else
    {
        A += cntR / 2;
        B += cntR / 2;
    }

    if (cntL % 2 != 0)
    {
        A += cntL / 2;
        B += cntL / 2 + 1;
    }
    else
    {
        A += cntL / 2;
        B += cntL / 2;
    }
    ans[R] = A;
    ans[L] = B;
    cntR = 0;
    cntL = 0;

    for (int i = 0; i < S.size() - 1; i++)
    {
        cout << ans[i] << " ";
    }
    cout << ans[S.size() - 1] << endl;
}

int main()
{
    std::string S;
    std::cin >> S;
    solve(S);
    return 0;
}


Measured memory_bytes: 1408