#include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
// minmax
template<class T> inline T SMIN(T& a, const T b) { return a=(a>b)?b:a; }
template<class T> inline T SMAX(T& a, const T b) { return a=(a<b)?b:a; }
// repetition
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)
#define REPE(i,n)  for(int i=0;i<=(n);++i)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  for(int i=0;i<(n);++i)
#define FORR(x,arr) for(auto& x:arr)
#define SZ(a) int((a).size())
// collection
#define ALL(c) (c).begin(),(c).end()
// DP
#define MINUS(dp) memset(dp, -1, sizeof(dp))
#define ZERO(dp) memset(dp, 0, sizeof(dp))
// stdout
#define println(args...) fprintf(stdout, ##args),putchar('\n');
// debug cerr
template<class Iter> void __kumaerrc(Iter begin, Iter end) { for(; begin!=end; ++begin) { cerr<<*begin<<','; } cerr<<endl; }
void __kumaerr(istream_iterator<string> it) { (void)it; cerr<<endl; }
template<typename T, typename... Args> void __kumaerr(istream_iterator<string> it, T a, Args... args) { cerr<<*it<<"="<<a<<", ",__kumaerr(++it, args...); }
template<typename S, typename T> std::ostream& operator<<(std::ostream& _os, const std::pair<S,T>& _p) { return _os<<"{"<<_p.first<<','<<_p.second<<"}"; }
#define __KUMATRACE__ true
#ifdef __KUMATRACE__
#define dump(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); __kumaerr(_it, args); }
#define dumpc(ar) { cerr<<#ar<<": "; FORR(x,(ar)) { cerr << x << ','; } cerr << endl; }
#define dumpC(beg,end) { cerr<<"~"<<#end<<": "; __kumaerrc(beg,end); }
#else
#define dump(args...)
#define dumpc(ar)
#define dumpC(beg,end)
#endif

// $ cp-batch GatheringChildren | diff GatheringChildren.out -
// $ g++ -std=c++14 -Wall -O2 -D_GLIBCXX_DEBUG -fsanitize=address GatheringChildren.cpp && ./a.out

/*
 
 8/6/2019
 
 12:02-12:35 AC
 
 https://img.atcoder.jp/abc136/editorial.pdf
 
 */

const int MAX_N=1e6+1;
string S;
int N;

const int MAX_K=61;
int suc[MAX_N][MAX_K];
void solve() {
  N=SZ(S);
  REP(i,N) suc[i][0]=S[i]=='R'?(i+1):(i-1);
  REP(k,MAX_K-1)REP(i,N) suc[i][k+1]=suc[suc[i][k]][k];
//  dumpC(suc[0],suc[0]+10);
  vector<LL> res(N,0);
  LL K=1e10;
//  dump(S);
  REP(i,N) {
    int p=i;
    REP(j,MAX_K) if((K>>j)&1) p=suc[p][j];
//    dump(p);
    res[p]++;
  }
  REP(i,N) printf("%lld ", res[i]);
  println("");
}


void solve_simulation() {
  N=SZ(S);
  vector<LL> res(N,0);
  REP(i,N-1) if(S[i]=='R'&&S[i+1]=='L') {
    LL l=0,r=0;
    for(int j=i; j>=0&&S[j]=='R'; --j) ++l;
    for(int j=i+1; j<N&&S[j]=='L'; ++j) ++r;
    LL a=(l+r)/2,b=l+r-a;
    res[i]=a,res[i+1]=b;
    if(a<b) {
      if(l>r&&(l-1)%2==0) swap(res[i],res[i+1]);
      else if(l<r&&(r-1)%2==1) swap(res[i],res[i+1]);
    }
  }
  REP(i,N) printf("%lld ", res[i]);
  println("");
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout<<setprecision(12)<<fixed;
  
  cin>>S;
  solve();
  
  return 0;
}


Measured memory_bytes: 26064