#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(v.begin(), v.end(),greater<int>());
#define INF 999999999
#define MOD 1000000007
#define M_PI 3.14159265358979323846
#define ALL(X) (X).begin(),(X).end()

#ifdef __LOCAL
    #define DBG(X) cout << #X << " = " << (X) << endl;
    #define SAY(X) cout << (X) << endl;
#else
    #define DBG(X)
    #define SAY(X)
#endif

#ifdef __LOCAL
    #include <filesystem>
    namespace fs = std::filesystem;
#endif

using namespace std;

using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

int dx[]={1, 0, -1, 0, 0};
int dy[]={0, 1, 0, -1, 0};
const int INT_INF = (int)(2e9);
const ll  LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
 
std::string pad(int num){ char buffer[4]; std::snprintf(buffer, sizeof(buffer), "%03d", num); return buffer;}
inline ll randint(ll a, ll b) { ll w = (_g() << 31LL) ^ _g(); return a + w % (b - a + 1); }
inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for (auto el : v) cout << el << " "; return os; }
template<typename T> inline T fetch() { T ret; cin >> ret; return ret; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for (auto& elem : ret) cin >> elem; return ret; }

string S;

void input(){
  fast_io();
  #ifdef __LOCAL
    fs::path p = __FILE__;
    fs::path input,output;
    input = output = p.parent_path();
    input += string("/input/") + string(p.stem()) + string(".txt");
    output += string("/output/") + string(p.stem()) + string(".txt");
    freopen(input.c_str(), "r", stdin);
    freopen(output.c_str(), "w", stdout);
  #endif
  cin >> S;
  
}

// 帰納的に答えを算出。
// 最悪O(N^2)なのでNが大きいとTLEになる。
int inductive_solve(){
  int N=S.size();
  vector<int> X(N,1);
  map<vector<int>,int> C;
  C[X]++;
  int I;

  REP(i,N+10){
    vector<int> tmp(N,0);    
    REP(i,N){
      if(S[i]=='R') tmp[i+1]+=X[i];
      if(S[i]=='L') tmp[i-1]+=X[i];
    }
    X = tmp;
    C[X]++;
    if(C[X]>1){
      I = i+1;
      break;
    }
    DBG(X)
  }
  if(I%2==0) cout << X << endl;
  else{
    vector<int> tmp(N,0);    
    REP(i,N){
      if(S[i]=='R') tmp[i+1]+=X[i];
      if(S[i]=='L') tmp[i-1]+=X[i];
    }
    X = tmp;
    cout << X << endl;
  }
  return 0;
}

int solve(){
  int N=S.size();
  vector<int> X(N,0);
  int sum;
  sum=0;
  for(int i=0;i<N;i++){
    if(S[i]=='R') sum++;
    else{ X[i-1]+=sum; sum=0;}
  }
  sum = 0;
  for(int i=(N-1);i>=0;i--){
    if(S[i]=='L') sum++;
    else{ X[i+1]+=sum; sum=0;}
  }
  DBG(X)
  vector<int> Y(N,0);
  REP(i,N-1){
    if(X[i]==0) continue;
    else{
      Y[i] = (X[i]+1)/2+X[i+1]/2;
      Y[i+1] = X[i]/2+(X[i+1]+1)/2;
      i++;
    }
  }
  DBG(Y)
  cout << Y << endl;
  return 0;
}

// int dp[10010][10010];
// dp(i,j) j番目の子どもがi回移動した後にいる位置。
// dp(1e5,j) が求める答え。
// O(NlogX) : X=1e5
int N;
map<int, vector<int> > dp;
int dp_f(int x, int j){
  if(dp[x].empty()) dp[x] = vector<int>(N+1,0);
  if(dp[x][j]) return dp[x][j];
  return dp[x][j] = x%2==0 ? dp_f(x/2,dp_f(x/2,j)):dp[1][dp_f(x/2,dp_f(x/2,j))];
}

int dp_solve(){

  N=S.size();
  int X = 1e5;
  // dp.assign(X,vector<int>(N,-1));
  // memset(dp,0,sizeof(dp));
  // for(int j=1;j<=N;j++) dp[0][j]=j;
  dp[1] = vector<int>(N+1,0);
  for(int j=1;j<=N;j++) dp[1][j]=(S[j-1]=='R')?j+1:j-1;
  // for(int j=1;j<=N;j++) dp[2][j]= dp[1][dp[1][j]];

  map<int,int> C;
  for(int j=1;j<=N;j++) C[dp_f(X,j)]++;
  vector<int> ans;
  for(int j=1;j<=N;j++) ans.push_back(C[j]);
  cout << ans << endl;
  return 0;
}

int main()
{
  input();
  dp_solve();
  return 0;
}


Measured memory_bytes: 12484