#include<bits/stdc++.h>
using namespace std;
char s[100005];
int a[100005];
void dfs(int l,int r){
	int flag=0,point=0;
	for(int i=l;i<r;i++){
		if(s[i]=='L'&&s[i+1]=='R'){
			flag=1;
			dfs(l,i);
			dfs(i+1,r);
			return;
		}
		if(s[i]=='R'&&s[i+1]=='L')point=i;
	}
	int x=(point-l+2)/2;
	a[point]+=x;
	a[point+1]+=point-l+1-x;
	int y=(r-point+1)/2;
	a[point+1]+=y;
	a[point]+=r-point-y;
	return;
}
int main(){
	scanf("%s",s+1);
	int len=strlen(s+1);
	dfs(1,len);
	for(int i=1;i<=len;i++)cout<<a[i]<<" ";
		
}
