#include <bits/stdc++.h>
using namespace std;

// 型定義
typedef long long ll;
typedef pair<ll, ll> P;

// forループ
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)

// 定数宣言
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;

// グラフ表現
using Graph = vector<vector<int>>;

// グラフの辺表現
using Edge = map<pair<int,int>,int>;

// n次元配列の初期化。第２引数の型のサイズごとに初期化していく。
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}

// 最大公約数
ll gcd(ll a,ll b){
   if (a%b == 0) return(b);
   else return(gcd(b, a%b));
}

// 最小公倍数
ll lcm(ll a, ll b){
    return a*b/gcd(a, b);
}

int main()
{
    cout << fixed << setprecision(15);
    string S;
    cin >> S;

    ll N = S.length();

    vector<ll> ans(N, 0);

    ll rcount = 0;
    ll lcount = 0;
    ll check = 0;
    REP(i, N){
        if(i == 0){
            rcount++;
            continue;
        }
        if(S[i-1] == 'R' && S[i] == 'R'){
            rcount ++;
            continue;
        }
        if(S[i-1] == 'L' && S[i] == 'L'){
            lcount ++;

            if(i == N-1){
                if(rcount%2 == 0 && lcount%2 == 0){
                    ans[check] = (lcount+rcount)/2;
                    ans[check+1] = (lcount+rcount)/2;
                }
                if(rcount%2 == 0 && lcount%2 == 1){
                    ans[check] = (lcount+rcount)/2;
                    ans[check+1] = (lcount+rcount)/2 + 1;
                }
                if(rcount%2 == 1 && lcount%2 == 0){
                    ans[check] = (lcount+rcount)/2+1;
                    ans[check+1] = (lcount+rcount)/2;
                }
                if(rcount%2 == 1 && lcount%2 == 1){
                    ans[check] = (lcount+rcount)/2;
                    ans[check+1] = (lcount+rcount)/2;
                }
            }
            continue;
        }
        if(S[i-1] == 'R' && S[i] == 'L'){
            check = i-1;
            lcount=1;

            if(i == N-1){
                // cout << rcount << " " << lcount << endl;
                if(rcount%2 == 0 && lcount%2 == 0){
                    ans[check] = (lcount+rcount)/2;
                    ans[check+1] = (lcount+rcount)/2;
                }
                if(rcount%2 == 0 && lcount%2 == 1){
                    ans[check] = (lcount+rcount)/2;
                    ans[check+1] = (lcount+rcount)/2 + 1;
                }
                if(rcount%2 == 1 && lcount%2 == 0){
                    ans[check] = (lcount+rcount)/2+1;
                    ans[check+1] = (lcount+rcount)/2;
                }
                if(rcount%2 == 1 && lcount%2 == 1){
                    ans[check] = (lcount+rcount)/2;
                    ans[check+1] = (lcount+rcount)/2;
                }
            }
            continue;
        }
        if(S[i-1] == 'L' && S[i] == 'R'){
            if(rcount%2 == 0 && lcount%2 == 0){
                ans[check] = (lcount+rcount)/2;
                ans[check+1] = (lcount+rcount)/2;
            }
            if(rcount%2 == 0 && lcount%2 == 1){
                ans[check] = (lcount+rcount)/2;
                ans[check+1] = (lcount+rcount)/2 + 1;
            }
            if(rcount%2 == 1 && lcount%2 == 0){
                ans[check] = (lcount+rcount)/2+1;
                ans[check+1] = (lcount+rcount)/2;
            }
            if(rcount%2 == 1 && lcount%2 == 1){
                ans[check] = (lcount+rcount)/2;
                ans[check+1] = (lcount+rcount)/2;
            }
            rcount = 1;
            continue;
        }
    }
    REP(i, N){
        if(i == N-1){
            cout << ans[i] << endl;
        }
        else{
            cout << ans[i] << " ";
        }
    }
    return 0;
}

Measured memory_bytes: 1408