//#include <bits/stdint.h>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <bitset>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef long long LL;

typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double PI  = acos(-1.0);

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
const LL MOD = 1e9+7; 
//vector <vector<int>> x(20, vector<int> (20)), y(20,vector<int> (20));
/*int counter_1 (int x) {
    if(x == 0) return 0;
    return counter_1(x >> 1) + (x & 1);
}*/

int main(){
  string s;
  cin >> s;
  int n = s.size();
  bool f = true, en = false;
  LL cntl=0, cntr=0;
  vector<LL> a(n, 0);
  int e=0;
  LL cnt = 0;
  REP(i,n){
    if(en==true) break;
    cntr++;
    //cout << cntr << ' ' <<  i << endl;
    if(s[i+1]=='L'){
      f=false;
      e=i;
      FOR(j,i+1,n){
        cntl++;
        if(j==n-1){
          en=true;
          break;
        }
        if(s[j+1]=='R'){
          //cout << cntr << ' ' << cntl << endl;
          cnt = cntl+cntr;
          if(cnt%2==0){
            a[i]=cnt/2;
            a[i+1]=cnt/2;
          }else{
            if(cntl>cntr){
              if(cntl%2==0){
                a[i]=cnt/2+1;
                a[i+1]=cnt/2;
              }else{
                a[i+1]=cnt/2+1;
                a[i]=cnt/2;
              }
            }else{
              if(cntr%2==1){
                a[i]=cnt/2+1;
                a[i+1]=cnt/2;
              }else{
                a[i+1]=cnt/2+1;
                a[i]=cnt/2;
              }
            }
          }
          f=true;
          cntr=0;
          cntl=0;

          i=j;
          break;
        }
      }
    }
  }
  if(f==false){
    int i = e;
    cnt = cntr+cntl;
    //cout << cntr << ' ' << cntl;
    if(cnt%2==0){
      a[i]=cnt/2;
      a[i+1]=cnt/2;
      }else{
      if(cntl>cntr){
        if(cntl%2==0){
          a[i]=cnt/2+1;
          a[i+1]=cnt/2;
        }else{
          a[i+1]=cnt/2+1;
          a[i]=cnt/2;
        }
      }else{
        if(cntr%2==1){
          a[i]=cnt/2+1;
          a[i+1]=cnt/2;
        }else{
          a[i+1]=cnt/2+1;
          a[i]=cnt/2;
        }
        
      }
    }
  }
  REP(i,n){
    cout << a[i] << ' ';
  }

}

Measured memory_bytes: 1408