#include <bits/stdc++.h>  // include all standard C++ libraries

using namespace std;

// Loops
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define _rrep(i,n) rrepi(i,n,0)
#define rrepi(i,a,b) for(int i=int(a)-1;i>=int(b);--i)

#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__)
#define each(xi, x) for (auto&& xi : x)
// Note: we can use rep(i,N) or rep(i,from,to)


// typedef
using ll = long long;
template <class T> using vec = vector<T>;
using vi   = vector<int>;
using vvi  = vector<vi>;
using vvvi = vector<vvi>;
using pii  = pair<int, int>;


// Constants

// Shorter repr for frequently used terms
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second


// Algorithms
#define all(x) (x).begin(), (x).end()
#define uniq(v) v.erase( unique(all(v)), v.end() )
#define perm(c) sort(all(c));for(bool c##p=1;c##p;c##p=next_permutation(all(c)))

template<class T> pair<T, size_t> max(vector<T> &x){ auto it = max_element(all(x)); return mp(*it, it-x.begin()); }
template<class T> pair<T, size_t> min(vector<T> &x){ auto it = min_element(all(x)); return mp(*it, it-x.begin()); }

template<class T> inline bool chmax(T &maxval, const T &newval) { if (maxval<newval) { maxval=newval; return 1; } return 0; }
template<class T> inline bool chmin(T &minval, const T &newval) { if (minval>newval) { minval=newval; return 1; } return 0; }

// Utilities
// Grid world utilities
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
#define inside(H,W,y,x) 0<=(x) && (x)<(W) && 0<=(y) && (y)<(H)

inline int in() {int x; cin >> x; return x;} // read int from cin
inline  ll IN() {ll x; cin >> x; return x;}  // read ll from cin



// Debug
#ifdef LOCAL
  #include "dump.hpp"
  #define debug(x) cerr << #x << ": " << x << '\n'
#else
  #define dump(...)
  #define debug(x)
#endif

// Paste snippets here!!

// 

int main(){
  cin.tie(0); ios::sync_with_stdio(false);    // Magic for faster cin
  string s; cin >>s;
  int n = s.length();

  // 文字列 s を R..RL..L のブロックに分解する
  int pos = 0; char state = 'R';
  vector<int> boundary = {0};
  while(pos<n){
    if(state=='R' && s[pos]=='R') pos++;
    else if (state=='R' && s[pos]=='L') {
      state = 'L'; pos++;
    }
    else if (state=='L' && s[pos]=='L') pos++;
    else if (state=='L' && s[pos]=='R') { state='R'; boundary.push_back(pos); pos++; }
  }
  boundary.push_back(n);
  vi ans(n,0);
  for(int i=0;i<boundary.size()-1;++i){
    int l = boundary[i];
    int r = boundary[i+1];
    int w = r-l;  // 区間の長さ
    int num_r = 0;
    for(int j=l;j<r;++j){
      if(s[j]=='L') break;
      num_r++;
    }
    int num_l = w-num_r;
    int num_even = 0;
    int num_odd = 0;
    if(num_r%2==0){ num_even += num_r/2; num_odd += num_r/2; }
    else { num_even += (num_r/2)+1; num_odd += (num_r/2); }

    if(num_l%2==0){ num_even += num_l/2; num_odd += num_l/2; }
    else { num_even += (num_l/2); num_odd += (num_l/2)+1; }

    ans[l+num_r-1] = num_even;
    ans[l+num_r] = num_odd;
  }
  rep(i,n){
    cout << ans[i] << " ";
  }
  cout << endl;
  return 0;
}


Measured memory_bytes: 1232