# Porblem D - Gathering Children

import re



# input process

S = input()



# initialization

ans_list = []

in_list = re.findall(r"R+L+", S)



# ["RRL", "RL"]

# part of list process

for p in in_list:

    p_r = re.findall(r"R+", p)[0]

    p_l = re.findall(r"L+", p)[0]

    l_count = 0

    r_count = 0



    # R to L process

    for i in range(1, len(p_r)+1):

        if i%2==0:

            l_count = l_count + 1

        else:

            r_count = r_count + 1



    # L to R process

    for i in range(1, len(p_l)+1):

        if i%2==0:

            r_count = r_count + 1

        else:

            l_count = l_count + 1



    # output prcess R

    for i in range(len(p_r)-1):

        ans_list.append(0)

    ans_list.append(r_count)



    # output process L

    ans_list.append(l_count)

    for i in range(len(p_l)-1):

        ans_list.append(0)



# output process

for a in ans_list:

    print(a, end=" ")

# Problem D - Gathering Children



import re



# input

S = eval(input())



# initialization

rl_list = re.findall(r'R+L+', S)

ans_list = []



# count

for rl in rl_list:

    right_count = 0

    left_count = 0



    right = re.findall(r'R+', rl)[0]

    left = re.findall(r'L+', rl)[0]



    # right count

    for i in range(1, len(right)+1):

        if i%2==0:

            left_count += 1

        else:

            right_count += 1



    # left count

    for i in range(1, len(left)+1):

        if i%2==0:

            right_count += 1

        else:

            left_count += 1



    # answer decision

    for i in range(len(right)-1):

        ans_list.append(0)

    ans_list.append(right_count)

    ans_list.append(left_count)

    for i in range(len(left)-1):

        ans_list.append(0)



# output

ans_list = list(map(str, ans_list))

print((" ".join(ans_list)))

# Porblem D - Gathering Children
import re

# input process
S = input()
# initialization
ans_list = []
in_list = re.findall(r"R+L+", S)
# ["RRL", "RL"]
# part of list process
for p in in_list:
    p_r = re.findall(r"R+", p)[0]
    p_l = re.findall(r"L+", p)[0]
    l_count = 0
    r_count = 0
    # R to L process
    for i in range(1, len(p_r) + 1):
        if i % 2 == 0:
            l_count = l_count + 1
        else:
            r_count = r_count + 1
    # L to R process
    for i in range(1, len(p_l) + 1):
        if i % 2 == 0:
            r_count = r_count + 1
        else:
            l_count = l_count + 1
    # output prcess R
    for i in range(len(p_r) - 1):
        ans_list.append(0)
    ans_list.append(r_count)
    # output process L
    ans_list.append(l_count)
    for i in range(len(p_l) - 1):
        ans_list.append(0)
# output process
for a in ans_list:
    print(a, end=" ")

# Problem D - Gathering Children
import re

# input
S = eval(input())
# initialization
rl_list = re.findall(r"R+L+", S)
ans_list = []
# count
for rl in rl_list:
    right_count = 0
    left_count = 0
    right = re.findall(r"R+", rl)[0]
    left = re.findall(r"L+", rl)[0]
    # right count
    for i in range(1, len(right) + 1):
        if i % 2 == 0:
            left_count += 1
        else:
            right_count += 1
    # left count
    for i in range(1, len(left) + 1):
        if i % 2 == 0:
            right_count += 1
        else:
            left_count += 1
    # answer decision
    for i in range(len(right) - 1):
        ans_list.append(0)
    ans_list.append(right_count)
    ans_list.append(left_count)
    for i in range(len(left) - 1):
        ans_list.append(0)
# output
ans_list = list(map(str, ans_list))
print((" ".join(ans_list)))

-# Porblem D - Gathering Children +# Problem D - Gathering Children -# input process -S = input() +# input +S = eval(input()) +rl_list = re.findall(r"R+L+", S) -in_list = re.findall(r"R+L+", S) -# ["RRL", "RL"] -# part of list process -for p in in_list: -    p_r = re.findall(r"R+", p)[0] -    p_l = re.findall(r"L+", p)[0] -    l_count = 0 -    r_count = 0 -    # R to L process -    for i in range(1, len(p_r) + 1): +# count +for rl in rl_list: +    right_count = 0 +    left_count = 0 +    right = re.findall(r"R+", rl)[0] +    left = re.findall(r"L+", rl)[0] +    # right count +    for i in range(1, len(right) + 1): -            l_count = l_count + 1 +            left_count += 1 -            r_count = r_count + 1 -    # L to R process -    for i in range(1, len(p_l) + 1): +            right_count += 1 +    # left count +    for i in range(1, len(left) + 1): -            r_count = r_count + 1 +            right_count += 1 -            l_count = l_count + 1 -    # output prcess R -    for i in range(len(p_r) - 1): +            left_count += 1 +    # answer decision +    for i in range(len(right) - 1): -    ans_list.append(r_count) -    # output process L -    ans_list.append(l_count) -    for i in range(len(p_l) - 1): +    ans_list.append(right_count) +    ans_list.append(left_count) +    for i in range(len(left) - 1): -# output process -for a in ans_list: -    print(a, end=" ") +# output +ans_list = list(map(str, ans_list)) +print((" ".join(ans_list)))