#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; }
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T>& V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> >& Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T>& mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }
template<typename T>vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
/*
 <url:>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */

template<class Type>
Type solve(Type res = Type()){
    string S; cin >> S;

    int N = (int)S.length();
    vector<ll> ans(N);
    
    
//    vector<int> M;
//    for(int i = 0; i < N-1;i++){
//        if(S[i] != S[i+1]){
//            M.push_back(i);
//        }
//    }
//
//    cout << M << endl;
//    for(int i = 0; i < N;i++){
//        if(S[i] == 'L'){
//            ll it = lower_bound(M.begin(),M.end(),i) - M.begin() - 1;
//
//            if((i - M[it])%2 == 0){
//                ans[M[it]]++;
//            }else{
//                ans[M[it]+1]++;
//            }
//        }else{
//            ll it = upper_bound(M.begin(),M.end(),i) - M.begin();
//            if((M[it]+1 - i)%2 == 0){
//                ans[M[it]+1]++;
//            }else{
//                ans[M[it]]++;
//            }
//        }
//    }

    
    int cnt = 0;
    for(int i = 0; i < N;i++){
        if(S[i] == 'R'){
            cnt++;
        }else{
            ans[i] += cnt/2;
            ans[i-1] += cnt - cnt/2;
            cnt = 0;
        }
    }
    cnt = 0;
    for(int i = N-1; i >= 0; i--){
        if(S[i] == 'L'){
            cnt++;
        }else{
            ans[i] += cnt/2;
            ans[i+1] += cnt - cnt/2;
            cnt = 0;
        }
    }
    
//    int even_cnt = 0;
//    int odd_cnt = 0;
//
//    while(L < N){
//        if(S[L] == 'R'){
//            if(turn){
//                even_cnt++;
//            }else{
//                odd_cnt++;
//            }
//            turn = !turn;
//        }else{
//            if(turn){
//                even_cnt++;
//            }else{
//                odd_cnt++;
//            }
//            if(even_cnt == odd_cnt){
//                S[L] = even_cnt;
//                S[L-1] = odd_cnt;
//            }else{
//                S[L-1] = even_cnt;
//                S[L] = odd_cnt;
//            }
//
//            even_cnt = odd_cnt = 0;
//            turn = false;
//        }
//        L++;
//    }
    
    res = ans;
    return res;
}
int main(void) {
    cin.tie(0); ios_base::sync_with_stdio(false);
    // solve(0);
    cout << fixed << setprecision(15) << solve<vector<ll>>() << endl;
    return 0;
}


Measured memory_bytes: 2000