import core.bitop;
import std.algorithm;
import std.ascii;
import std.bigint;
import std.conv;
import std.functional;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.random;
import std.typecons;
import std.container;

alias sread = () => readln.chomp();
ulong bignum = 1_000_000_007;
alias SugarWater = Tuple!(long, "swater", long, "sugar");

T lread(T = long)()
{
    return readln.chomp.to!T();
}

T[] aryread(T = long)()
{
    return readln.split.to!(T[])();
}

void scan(TList...)(ref TList Args)
{
    auto line = readln.split();
    foreach (i, T; TList)
    {
        T val = line[i].to!(T);
        Args[i] = val;
    }
}

void main()
{
    auto s = sread();
    auto cost_right = new long[](s.length);
    auto cost_left = new long[](s.length);
    auto iter = iota(0, s.length);
    long count;
    foreach (i; iter)
    {
        if (s[i] == 'L')
            cost_left[i] = ++count;
        else
        {
            count = 0;
        }
    }
    count = 0;
    foreach_reverse (i; iter)
    {
        if (s[i] == 'R')
            cost_right[i] = ++count;
        else
        {
            count = 0;
        }
    }
    auto ans = new long[](s.length);
    foreach (i; iter)
    {
        if (s[i] == 'R')
        {
            if (cost_right[i] % 2)
                ans[i + cost_right[i] - 1]++;
            else
                ans[i + cost_right[i]]++;
        }
        else
        {
            if (cost_left[i] % 2)
                ans[i - cost_left[i] + 1]++;
            else
                ans[i - cost_left[i]]++;
        }
    }

    formatwrite(ans);
    // cost_left.writeln();
    // cost_right.writeln();
}

void formatwrite(T)(T a)
{
    foreach (i, e; a)
    {
        if (i != a.length - 1)
            e.write(" ");
        else
            e.writeln();
    }
}