//include
//------------------------------------------
#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>
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 vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
//container util
//------------------------------------------

#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define VECMAX(x) *max_element(ALL(x))
#define VECMIN(x) *min_element(ALL(x))
#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)
#define MULTIPLE(i,n,k) for(int i = (k) ; i<(n) ; i+=k+1)//倍数ループ
//constant
//------------------------------------------
const double EPS = 1e-10;
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;






#define SIZEOF(x) sizeof(x)/sizeof(x[0])




template <class T>
T max(T *a , LL n){
    T maxi = a[0];
    for(LL i = 0; i < n; ++i){
        if(a[i] > maxi)maxi = a[i];
    }
    return maxi;
}

template <class T>
T maxfrag(T *a , LL n){
    T maxi = a[0];
    T frag = 0;
    for(LL i = 0; i < n; ++i){
        if(a[i] > maxi){
            maxi = a[i];
            frag = i;
        }
    }
    return frag;
}


template <class T>
T min(T *a , LL n){
    T mini = a[0];
    for(LL i = 0; i < n; ++i){
        if(a[i] < mini)mini = a[i];
    }
    return mini;
}

template <class T>
T minfrag(T *a , LL n){
    T mini = a[0];
    T frag = 0;
    for(LL i = 0; i < n; ++i){
        if(a[i] < mini){
            mini = a[i];
            frag = i;
        }
    }
    return frag;
}


template <class T>
T sum(T *a , LL n){
    T s=0;
    for(LL i = 0; i < n; ++i){
       s+=a[i]; 
    }
    return s;
}

#define MAX(x) max(x,SIZEOF(x))
#define MIN(x) min(x,SIZEOF(x))
#define SUM(x) sum(x,SIZEOF(x))



int main(){
    string s;
    cin >> s;
    vector <LL> change(0);
    change.push_back(0);
    char frag = s[0];
    REP(i , s.size()){
        if(frag == 'R' && s[i] == 'L')change.push_back(i);
        frag = s[i];
    }
    
    change.push_back(s.size());
    LL Lcount = 0;
    LL Rcount = 1;
    LL L = change[Lcount];
    LL R = change[Rcount];
    LL E[s.size()];
    //REP(i , change.size())cout << change[i] << " ";
    //cout << "\n";
   REP(i , s.size())E[i] = 0;

    REP(i , s.size()){
        if(i == s.size()){
            
        }
        else if (i >= change[Rcount]){
            Lcount += 1;
            Rcount += 1;
        }
        switch(s[i]){
            case 'L':
               if(  (i - change[Lcount]) %2 == 0){
                   E[change[Lcount]] += 1;
               }else{
                   if(Lcount == 0)E[change[Lcount]+1] += 1;
                   else E[change[Lcount]-1] += 1;
               }

                break;




            case 'R':
                if( (change[Rcount]-1 - i) %2 == 0 ){
                    E[change[Rcount]-1] += 1;
                }else{
                    if(Rcount == change.size()-1)E[change[Rcount]-1] += 1;
                    else E[change[Rcount]] += 1;
                }
                break;



        }





    }
    REP(i , s.size()){
        cout << E[i];
        if(i != s.size()-1)cout << " ";
    }


    
    return 0;

}


Measured memory_bytes: 1912