/*
これを入れて実行
g++ code.cpp
./a.out
 */
 
#include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
 
using namespace std;
typedef long long ll;
typedef long double ld;
 
int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
 
const long long INF = 1LL << 60;
const ll MOD = 1e9 + 7;
 
bool greaterSecond(const pair<int, int>& f, const pair<int, int>& s){
    return f.second > s.second;
}
 
ll gcd(ll a, ll b){
	if (b == 0)return a;
	return gcd(b, a % b);
}
 
ll lcm(ll a, ll b){
    return a / gcd(a, b) * b;
}
 
ll nCr(ll n, ll r){
    if(r == 0 || r == n){
        return 1;
    } else if(r == 1){
        return n;
    }
    return (nCr(n - 1, r) + nCr(n - 1, r - 1));
}
 
ll nPr(ll n, ll r){
    r = n - r;
    ll ret = 1;
    for (ll i = n; i >= r + 1; i--) ret *= i;
    return ret;
}
 
//-----------------------ここから-----------

int main(void){
    string s;
    cin >> s;

    vector<int> ans(s.size());
    int rcnt = 0;
    int lcnt = 0;
    bool fin = false;
    for(int i = 0; i < s.size(); i++){
        if(s[i] == 'L'){
            for(int j = i; j < s.size(); j++){
                if(s[j] == 'R'){
                    if((rcnt + lcnt) % 2 == 0){
                        ans[i - 1] = (rcnt + lcnt) / 2;
                        ans[i] = (rcnt + lcnt) / 2;
                    } else {
                        if(rcnt % 2 == 0){
                            ans[i] = (rcnt + lcnt) / 2 + 1;
                            ans[i - 1] = (rcnt + lcnt) / 2;
                        } else {
                            ans[i] = (rcnt + lcnt) / 2;
                            ans[i - 1] = (rcnt + lcnt) / 2 + 1;
                        }
                    }
                    i = j - 1;
                    lcnt = 0;
                    rcnt = 0;
                    break;
                } else {
                    lcnt++;
                    if(j == s.size() - 1){
                        if((rcnt + lcnt) % 2 == 0){
                            ans[i - 1] = (rcnt + lcnt) / 2;
                            ans[i] = (rcnt + lcnt) / 2;
                        } else {
                            if(rcnt % 2 == 0){
                                ans[i] = (rcnt + lcnt) / 2 + 1;
                                ans[i - 1] = (rcnt + lcnt) / 2;
                            } else {
                                ans[i] = (rcnt + lcnt) / 2;
                                ans[i - 1] = (rcnt + lcnt) / 2 + 1;
                            }
                        }
                        fin = true;
                        lcnt = 0;
                        rcnt = 0;
                        break;
                    }
                }
            }
            if(fin) break;
        } else {
            rcnt++;
        }
    }

    for(int i = 0; i < s.size(); i++){
        if(i != s.size() - 1){
            cout << ans[i] << " ";
        } else {
            cout << ans[i] << endl;
        }
        
    }
}

Measured memory_bytes: 1024