/*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG //FOR THE DEBUG! COMMENT OUT THIS WHEN SUBMITTING!
#endif
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <iomanip>
#include <limits>//setprecision
//#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
//#include <unordered_set> //unordered_set
#include <stack> // stack
#include <deque> // deque
#include <math.h>//pow,,,
#include <cmath>//abs,,,
#include <bitset> // bitset
//It is so troublesome that I include bits/stdc++.h !
using namespace std;

template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
const long long INF = 100100100100;
const long long MOD = 1000000007;
typedef pair<int,long long> P;

//Solve N^M. This, mod_pow use Iterative Square Method.
long long mod_pow(long long N, long long M) {
    if (M == 0) return 1;
    long long res = mod_pow((N * N) % MOD, M / 2);
    //最下位ビット(*N)が1の時は単独でNをかける
    if (M & 1) res = (res * N) % MOD;

    return res %= MOD;
}

long long gcd(long long a, long long b) {
    if (b == 0) return a;
    else return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
    return a * b / gcd(a, b);
}

vector<int> ans(100003);

int main() {
    string S;cin >> S;
    int N = S.size();
    int Leftindex = 0,Rightindex = 0;
    int Leftcount = 0,Rightcount = 0;
    char now = 'R',past = 'R';
    int ren = 0;
    for(int i = 0;i<N;i++){
        now = S.at(i);
        //cout << now << " " << past << endl;
        if(now == 'L' && past == 'R'){
            Rightindex = i-1;
            Leftindex = i;
            past = 'L';
            Rightcount = ren;
        }
        if(now == 'R' && past == 'L'){
            Leftcount = ren-Rightcount;
            past = 'R';
            if(Leftcount % 2 == 0){
                ans.at(Leftindex) = ren/2;
                ans.at(Rightindex) = ren-ans.at(Leftindex);
            }
            else{
                ans.at(Rightindex) = ren/2;
                ans.at(Leftindex) = ren-ans.at(Rightindex);
            }
            //cout << Leftindex << " " << Rightindex << " " << ren << endl;
            ren = 0;
        }
        ren++;
        if(i == N-1){
            Leftcount = ren-Rightcount;
            past = 'R';
            if(Leftcount % 2 == 0){
                ans.at(Leftindex) = ren/2;
                ans.at(Rightindex) = ren-ans.at(Leftindex);
            }
            else{
                ans.at(Rightindex) = ren/2;
                ans.at(Leftindex) = ren-ans.at(Rightindex);
            }
            //cout << Leftindex << " " << Rightindex << " " << ren << endl;
            ren = 0;
        }
    }
    for(int i = 0;i<N;i++) cout << ans.at(i) << endl;
}


Measured memory_bytes: 1024