def solve():

    S = eval(input())

    result = [0] * len(S)

    children_position = []

    even_odd_sum = []

    even_sum = 0

    odd_sum = 0

    R_i = 0

    L_i = -2

    

    for idx, s in enumerate(S):

        

        if s == 'R':

            R_i = idx

            if L_i+1 == R_i:

                even_odd_sum.append((even_sum, odd_sum))

                even_sum = 0

                odd_sum = 0

        elif s == 'L':

            L_i = idx

            if R_i+1 == idx:

                children_position.append((R_i, L_i))

                

        even_sum += idx % 2 == 0

        odd_sum += idx % 2 == 1

                

    even_odd_sum.append((even_sum, odd_sum))

    # print(children_position, even_odd_sum)

    for idx in range(len(children_position)):

        t = children_position[idx]

        even_odd_R = t[0] % 2

        even_odd_L = t[1] % 2

        

        result[t[0]] = even_odd_sum[idx][0] if even_odd_R == 0 else even_odd_sum[idx][1]

        result[t[1]] = even_odd_sum[idx][0] if even_odd_L == 0 else even_odd_sum[idx][1]

        

    

    print((' '.join(map(str, result))))

solve()
S = eval(input())

ret = [0] * len(S)

cont_R = 0

idx_R = 0

cont_L = 0



for i,s in enumerate(S):

    if s == 'R':

        cont_L = 0

        cont_R += 1

        idx_R = i

        idx_L = i+1

    elif s == 'L':

        if idx_L == i:

            q = cont_R//2

            r = cont_R%2

            ret[idx_R] = q+r

            ret[idx_L] = q

            # print(ret,idx_R,idx_L)

        cont_R = 0

        cont_L += 1

        if cont_L % 2 == 1:

            ret[idx_L] += 1

        else:

            ret[idx_R] += 1



print((' '.join(map(str, ret))))
def solve():
    S = eval(input())
    result = [0] * len(S)
    children_position = []
    even_odd_sum = []
    even_sum = 0
    odd_sum = 0
    R_i = 0
    L_i = -2
    for idx, s in enumerate(S):
        if s == "R":
            R_i = idx
            if L_i + 1 == R_i:
                even_odd_sum.append((even_sum, odd_sum))
                even_sum = 0
                odd_sum = 0
        elif s == "L":
            L_i = idx
            if R_i + 1 == idx:
                children_position.append((R_i, L_i))
        even_sum += idx % 2 == 0
        odd_sum += idx % 2 == 1
    even_odd_sum.append((even_sum, odd_sum))
    # print(children_position, even_odd_sum)
    for idx in range(len(children_position)):
        t = children_position[idx]
        even_odd_R = t[0] % 2
        even_odd_L = t[1] % 2
        result[t[0]] = even_odd_sum[idx][0] if even_odd_R == 0 else even_odd_sum[idx][1]
        result[t[1]] = even_odd_sum[idx][0] if even_odd_L == 0 else even_odd_sum[idx][1]
    print((" ".join(map(str, result))))


solve()

S = eval(input())
ret = [0] * len(S)
cont_R = 0
idx_R = 0
cont_L = 0
for i, s in enumerate(S):
    if s == "R":
        cont_L = 0
        cont_R += 1
        idx_R = i
        idx_L = i + 1
    elif s == "L":
        if idx_L == i:
            q = cont_R // 2
            r = cont_R % 2
            ret[idx_R] = q + r
            ret[idx_L] = q
            # print(ret,idx_R,idx_L)
        cont_R = 0
        cont_L += 1
        if cont_L % 2 == 1:
            ret[idx_L] += 1
        else:
            ret[idx_R] += 1
print((" ".join(map(str, ret))))

-def solve(): -    S = eval(input()) -    result = [0] * len(S) -    children_position = [] -    even_odd_sum = [] -    even_sum = 0 -    odd_sum = 0 -    R_i = 0 -    L_i = -2 -    for idx, s in enumerate(S): -        if s == "R": -            R_i = idx -            if L_i + 1 == R_i: -                even_odd_sum.append((even_sum, odd_sum)) -                even_sum = 0 -                odd_sum = 0 -        elif s == "L": -            L_i = idx -            if R_i + 1 == idx: -                children_position.append((R_i, L_i)) -        even_sum += idx % 2 == 0 -        odd_sum += idx % 2 == 1 -    even_odd_sum.append((even_sum, odd_sum)) -    # print(children_position, even_odd_sum) -    for idx in range(len(children_position)): -        t = children_position[idx] -        even_odd_R = t[0] % 2 -        even_odd_L = t[1] % 2 -        result[t[0]] = even_odd_sum[idx][0] if even_odd_R == 0 else even_odd_sum[idx][1] -        result[t[1]] = even_odd_sum[idx][0] if even_odd_L == 0 else even_odd_sum[idx][1] -    print((" ".join(map(str, result)))) - - -solve() +S = eval(input()) +ret = [0] * len(S) +cont_R = 0 +idx_R = 0 +cont_L = 0 +for i, s in enumerate(S): +    if s == "R": +        cont_L = 0 +        cont_R += 1 +        idx_R = i +        idx_L = i + 1 +    elif s == "L": +        if idx_L == i: +            q = cont_R // 2 +            r = cont_R % 2 +            ret[idx_R] = q + r +            ret[idx_L] = q +            # print(ret,idx_R,idx_L) +        cont_R = 0 +        cont_L += 1 +        if cont_L % 2 == 1: +            ret[idx_L] += 1 +        else: +            ret[idx_R] += 1 +print((" ".join(map(str, ret))))