#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<ll,ll> P;
 
long long int INF = 3e18;
double Pi = 3.1415926535897932384626;
 
vector<ll> G1[500005];
vector<ll> G2[500005];
//vector<P> tree[500010];
priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop
 
int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//ll bit[500005];
//↓,→,↑,←
 
 
#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<(x)<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
 
 
ll mod = 1000000007;
ll rui(ll number1,ll number2){
 
    if(number2 == 0){
        return 1;
    }else{
        ll number3 = rui(number1,number2 / 2);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll gcd(ll number1,ll number2){
 
    if(number1 > number2){
        swap(number1,number2);
    }
    if(number1 == 0 || number1 == number2){
        return number2;
    }else{
        return gcd(number2 % number1,number1);
    }
}
void YES(bool condition){
 
    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){
 
    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}

 
//ll fact[800005],rfact[800005];
/*
void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=800000; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
    rfact[800000] = rui(fact[800000],mod - 2);
    for(ll i=800000; i>=1; i--){
       rfact[i-1] = rfact[i] * i;
       rfact[i-1] %= mod;
    }
    return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod) * rfact[n-r]) % mod;}
*/
 
ll n,m,sum,ans,a,b,c,e,g,h,w,i,j,k,q;
ll x[500005],y[500005],z[500005];
char s[500005];
bool dame;
ll num = 0;

void solve(ll r,ll l){
    //pe(r);p(l);
    ll ans_r = 0,ans_l = 0;
    if((r + l) % 2 == 0){
        ans_r = (r + l) / 2;
        ans_l = (r + l) / 2;
    }else{
        if(r > l){
            ans_l = (r + l) / 2 + 1;
            ans_r = (r + l) / 2;
            if(r % 2 == 1){
                swap(ans_l,ans_r);
            }
        }else{
            ans_l = (r + l) / 2 + 1;
            ans_r = (r + l) / 2;
            if(l % 2 == 0){
                swap(ans_l,ans_r);
            }
        }
    }
    for(ll i=num;i<num+r-1;i++){
        x[i] = 0;
    }
    x[num+r-1] = ans_r;
    x[num+r] = ans_l;
    for(ll i=num+r+1;i<num+r+l;i++){
        x[i] = 0;
    }
    num += r + l;
    return;
}

int main(){
    cin >> s;
    n = strlen(s);
    int now = 0;
    ll r = 0,l = 0;
    for(ll i=0;i<n;i++){
        if(s[i] == 'L'){
            l++;
            now = 1;
        }else{
            if(now == 1){
                // L to R
                solve(r,l);
                r = 0;
                l = 0;
            }
            r++;
            now = 2;
        }
    }
    if(now == 1){
        solve(r,l);
    }else{
        solve(r,l);
    }
    for(i=0;i<n;i++){
        pe(x[i]);
    }
    el;
    return 0;
}












Measured memory_bytes: 28032