#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;


typedef tree<int, null_type, less<int>, rb_tree_tag,
        tree_order_statistics_node_update>
        new_data_set;


#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define PSET(x,y) fixed<<setprecision(y)<<x
#define pb push_back
#define pf push_front
#define pii pair<int,int>
#define mp make_pair
#define vi vector<int>
#define vip vector<pair<int,int> >
#define ff first
#define ss second
#define int long long
#define SIZE 200010
#define mod 1000000007
#define BIG 998244353
#define s(t) scanf("%d",&t)
#define p(t) printf("%d\n",t)
#define mii map<int,int>
#define MSET(table,i) memset(table, i, sizeof(table))
#define endl '\n'
#define tc int t;cin>>t;while(t--)
#define pi  3.1415926358
#define print(x) for(auto el: x) cout<<el<<" ";cout<<endl
#define bits(x) __builtin_popcount(x)
#define minimum(a,n) min_element(a,a+n)-a
#define maximum(a,n) max_element(a,a+n)-a
#define pqbig priority_queue<int>
#define pqsmall priority_queue<int,vector<int>,greater<int> >
#define all(v) v.begin(),v.end()
#define sitr set<int>:: iterator
#define mitr map<int,int>:: iterator


#define trace1(x)                cerr<<#x<<": "<<x<<endl
#define trace2(x, y)             cerr<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl
#define trace3(x, y, z)          cerr<<#x<<":" <<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl
#define trace4(a, b, c, d)       cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<endl
#define trace5(a, b, c, d, e)    cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<< ": "<<e<<endl
#define trace6(a, b, c, d, e, f) cerr<<#a<<": "<<a<<" | "<<#b<<": "<<b<<" | "<<#c<<": "<<c<<" | "<<#d<<": "<<d<<" | "<<#e<< ": "<<e<<" | "<<#f<<": "<<f<<endl

const int N=1e5+5;
int arr[N];


int32_t main()
{
    fast;
    string s;cin>>s;
    int n=s.size();
    
    int cntR=0;
    for(int i=0;i<n;i++)
    {
        if(s[i]=='R')
            cntR++;
        if(s[i+1]=='L')
            arr[i]=cntR,cntR=0;
    }
    int cntL=0;
    for(int i=n-1;i>=0;i--)
    {
        if(s[i]=='L')
            cntL++;
        if(s[i-1]=='R' and cntL)
            arr[i]=cntL,cntL=0;
    }


    for(int i=0;i<n-1;i++)
    {
        if(s[i]=='R' and s[i+1]=='L')
        {
            int left=arr[i];
            int right=arr[i+1];
            if(abs(right-left)%2==0)
            {
                arr[i]=(left+right)/2;
                arr[i+1]=(left+right)/2;
            }
            else
            {
                if(left>right)
                {
                    arr[i+1]=(left- right)/2;
                    arr[i]=(left - right)/2+1;
                }
                else
                {
                    arr[i+1]=(right-left)/2+1;
                    arr[i]=(right-left)/2;
                }

                arr[i]+=min(left,right);
                arr[i+1]+=min(left,right);

                if(max(left,right)%2==0)
                    swap(arr[i],arr[i+1]);
            }
        }
    }

    for(int i=0;i<n;i++)
        cout<<arr[i]<<' ';

}

Measured memory_bytes: 1488