#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;

int a[100001]={0};

int main()
{
    char t;
    int n=-1;
    while(n++,(t=getchar())!='\n')if(t=='L')a[n]=-1;

    int cnt=0;
    for(int i=0;i<n-1;i++)
    {
        if(a[i]==0&&a[i+1]==0)
            cnt++;
        else if(a[i]==0&&a[i+1]==-1)
            a[i]=cnt+1,cnt=0;
    }
    cnt=0;
    for(int i=n-1;i>0;i--)
    {
        if(a[i]==-1&&a[i-1]==-1)
            cnt++;
        else if(a[i]==-1&&a[i-1]>0)
            a[i]=cnt+1,cnt=0;
    }
    for(int i=0;i<n;i++)
    {
        if(a[i]<=0)printf("0 ");
        else if(a[i+1]>0)
        {
            int num = a[i]+a[i+1];
            if((num&1)==0)printf("%d %d ",num>>1,num>>1);
            else if((a[i]&1)==0)
                printf("%d %d ",num>>1,(num>>1)+1);
            else printf("%d %d ",(num>>1)+1,num>>1);
            i++;
        }
    }
    printf("\n");
    return 0;
}
