#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;



int main(){
    ll N=0;
    string str;
    cin >> str;
    N=str.size();
    vector<char> S(N,' ');
    for(int i=0;i<N;i++){
        S[i]=str.at(i)
    ;}
    vector<ll> exist(N,0);
    vector<bool> check(N,0);
    ll lcounter=0;
       for(int i=0;i<N;i++){
           if(S[i]=='L'){
               lcounter++;
           }
       ;}
if(lcounter>=N/2){
    for(int i=0;i<N;i++){
        if(check[i]){continue;}
        else if(S[i]=='R'){
            ll counter=i;
            for(int j=i;j<N;j++){
                if(S[j]=='L'){
                    counter=j;break;
                }
            ;}
            if((counter-i)%2==0){
                exist[counter]++;
            }
            if((counter-i)%2==1){
                exist[counter-1]++;
            }
            check[i]=1;
            /*for(int j=i-1;j>=0;j--){
                if(S[j]=='R'){
                    if((counter-j)%2==1){exist[counter-1]++;}
                    if((counter-j)%2==0){exist[counter]++;}
                    check[j]=1;
                }
                else break;
            ;}*/
        }
        else if(S[i]=='L'){
            ll counter=i;
            for(int j=i;j>=0;j--){
                if(S[j]=='R'){
                    counter=j;break;
                }
            ;}
            if((i-counter)%2==0){
                exist[counter]++;
            }
            if((i-counter)%2==1){
                exist[counter+1]++;
            }
            check[i]=1;
            for(int j=i+1;j<N;j++){
                if(S[j]=='L'){
                    if((j-counter)%2==1){exist[counter+1]++;}
                    if((j-counter)%2==0){exist[counter]++;}
                    check[j]=1;
                }
                else break;
            ;}

        }
    ;}}
    
else{
    for(int i=N-1;i>=0;i--){
        if(check[i]){continue;}
        else if(S[i]=='R'){
            ll counter=i;
            for(int j=i;j<N;j++){
                if(S[j]=='L'){
                    counter=j;break;
                }
            ;}
            if((counter-i)%2==0){
                exist[counter]++;
            }
            if((counter-i)%2==1){
                exist[counter-1]++;
            }
            check[i]=1;
            for(int j=i-1;j>=0;j--){
                if(S[j]=='R'){
                    if((counter-j)%2==1){exist[counter-1]++;}
                    if((counter-j)%2==0){exist[counter]++;}
                    check[j]=1;
                }
                else break;
            ;}
        }
        else if(S[i]=='L'){
            ll counter=i;
            for(int j=i;j>=0;j--){
                if(S[j]=='R'){
                    counter=j;break;
                }
            ;}
            if((i-counter)%2==0){
                exist[counter]++;
            }
            if((i-counter)%2==1){
                exist[counter+1]++;
            }
            check[i]=1;
            /*for(int j=i+1;j<N;j++){
                if(S[j]=='L'){
                    if((j-counter)%2==1){exist[counter+1]++;}
                    if((j-counter)%2==0){exist[counter]++;}
                    check[j]=1;
                }
                else break;
            ;}*/

        }
    ;}}
    for(int i=0;i<N;i++){
        cout<<exist[i]<<' ';
    ;}



return 0;


}  



Measured memory_bytes: 1408