/*
ID: Aman Raj
LANG: C++
TASK: prefix
*/
//#include<iostream>
#include <stdio.h>
//#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
#include<math.h>
typedef  long long int ll;
#include <bits/stdc++.h>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <utility>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <iomanip>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//setbase - cout << setbase (16); cout << 100 << endl; Prints 64
//setfill -   cout << setfill ('x') << setw (5); cout << 77 << endl; prints xxx77
//setprecision - cout << setprecision (14) << f << endl; Prints x.xxxx
//cout.precision(x)  cout<<fixed<<val;  // prints x digits after decimal in val

using namespace std;
using namespace __gnu_pbds;

#define f(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) f(i,0,n)
#define fd(i,a,b) for(i=a;i>=b;i--)
#define pb push_back
#define mp make_pair
#define vi vector< int >
#define vl vector< ll >
#define ss second
#define ff first
//#define ll long long
#define pii pair< int,int >
#define pll pair< ll,ll >
#define sz(a) a.size()
#define inf (1000*1000*1000+5)
#define all(a) a.begin(),a.end()
#define tri pair<int,pii>
#define vii vector<pii>
#define vll vector<pll>
#define viii vector<tri>
#define mod (1000*1000*1000+7)
//#define mod 13
#define pqueue priority_queue< int >
#define pdqueue priority_queue< int,vi ,greater< int > >
//#define flush fflush(stdout)
#define primeDEN 727999983
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#include <fstream>
// find_by_order()  // order_of_key
typedef tree<
	int,
	null_type,
	less<int>,
	rb_tree_tag,
	tree_order_statistics_node_update>
	ordered_set;
   ll power(ll a,ll b)//a raised to power b
   {  if(b==0)return 1;if(b==1)return a;
       ll c=power(a,b/2);
       c*=c;c%=mod;if(b%2==1)c*=a;c%=mod;
        return c;
   }
   ll mi(ll a)
   {
       return power(a,mod-2);
   }

   //double l1,r1,p1,l2,r2,p2;
  ll aman(ll i)
  {
      vector<ll> v;
       ll sum=0;
       while(i>0)
       {
           v.push_back(i%10);
           i/=10;
       }
       reverse(all(v));
       if(v.size()==1)return v[0];
       ll p=-1;
       while(v.size()>0)
       {p++;
         ll a=v.back();v.pop_back();ll b=-1;if(v.size()>0)b=v.back();
          if(a==b)continue;
           else {sum+=a*power(10,p);sum%=mod;}

       }
       return sum;
  }

   int main()
{    string s; cin>>s;
     ll n=s.size();
      vector<ll> vans(n,0);
      ll i=0;ll r=0,l=0;bool ok=false;
      while(i<n)
      { if(s[i]=='R'&&!ok){r++;i++;continue;}
        else if(s[i]=='L')
        {  //cout<<2<<i<<endl;
            ok=true;l++;
            if(i==n-1)
            {   if((l+r)%2==0)
              {vans[i-l+1]=(r+l)/2;vans[i-l]=(r+l)/2; }
            else
            {
                    if(r>l&&r%2==0){vans[i-l+1]=(r+l)/2 +1;vans[i-l]=(r+l)/2;      }
                    else if(r>l&&r%2==1){vans[i-l+1]=(r+l)/2 ;vans[i-l]=(r+l)/2 + 1;      }
                    else if(l>r&&l%2==0){vans[i-l+1]=(r+l)/2 ;vans[i-l]=(r+l)/2 + 1;      }
                    else if(l>r&&l%2==1){vans[i-l+1]=(r+l)/2 +1;vans[i-l]=(r+l)/2;      }
            }

            }
            i++;continue;
        }
        else if(s[i]=='R'&&ok)
        {  //cout<<r<<l<<i<<endl;
            ok=false;
            if((l+r)%2==0)
            {vans[i-l]=(r+l)/2;vans[i-l-1]=(r+l)/2; l=0;r=0;  continue;}
            else
            {
                    if(r>l&&r%2==0){vans[i-l]=(r+l)/2 +1;vans[i-l-1]=(r+l)/2;      }
                    else if(r>l&&r%2==1){vans[i-l]=(r+l)/2 ;vans[i-l-1]=(r+l)/2 + 1;      }
                    else if(l>r&&l%2==0){vans[i-l]=(r+l)/2 ;vans[i-l-1]=(r+l)/2 + 1;      }
                    else if(l>r&&l%2==1){vans[i-l]=(r+l)/2 +1;vans[i-l-1]=(r+l)/2;}
                    l=0;r=0;
                    continue;
            }

        }


      }
      for(auto x:vans)cout<<x<<" ";

   return 0;
 }


Measured memory_bytes: 1408