from collections import Counter,defaultdict,deque

from heapq import heappop,heappush,heapify

import sys,bisect,math,itertools,fractions,pprint

sys.setrecursionlimit(10**8)

mod = 10**9+7

INF = float('inf')

def inp(): return int(sys.stdin.readline())

def inpl(): return list(map(int, sys.stdin.readline().split()))

def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))



s = eval(input())

n = len(s)

cnt = 0

res = [0] * n

for i,t in enumerate(s):

    if t == 'R':

        cnt += 1

    elif cnt > 0:

        res[i-1] += (cnt+1)//2

        res[i] += cnt//2

        cnt = 0

# print(*res)

for i in reversed(list(range(n))):

    if s[i] == 'L':

        cnt += 1

    elif cnt > 0:

        res[i+1] += (cnt+1)//2

        res[i] += cnt//2

        cnt = 0

print((*res))
from collections import Counter,defaultdict,deque

from heapq import heappop,heappush

from bisect import bisect_left,bisect_right 

import sys,math,itertools,fractions

sys.setrecursionlimit(10**8)

mod = 10**9+7

INF = float('inf')

def inp(): return int(sys.stdin.readline())

def inpl(): return list(map(int, sys.stdin.readline().split()))



s = eval(input())

n = len(s)

res = [0] * n

cnt = 0

now = [0,0]

for i in range(n):

    if s[i] == 'R':

        now[cnt%2] += 1

        cnt += 1

    else:

        res[i-1] += now[0]

        res[i] += now[1]

        now = [0,0]

        cnt = 0

for i in range(n)[::-1]:

    if s[i] == 'L':

        now[cnt%2] += 1

        cnt += 1

    else:

        res[i+1] += now[0]

        res[i] += now[1]

        now = [0,0]

        cnt = 0

print((*res))
from collections import Counter, defaultdict, deque
from heapq import heappop, heappush, heapify
import sys, bisect, math, itertools, fractions, pprint

sys.setrecursionlimit(10**8)
mod = 10**9 + 7
INF = float("inf")


def inp():
    return int(sys.stdin.readline())


def inpl():
    return list(map(int, sys.stdin.readline().split()))


def inpln(n):
    return list(int(sys.stdin.readline()) for i in range(n))


s = eval(input())
n = len(s)
cnt = 0
res = [0] * n
for i, t in enumerate(s):
    if t == "R":
        cnt += 1
    elif cnt > 0:
        res[i - 1] += (cnt + 1) // 2
        res[i] += cnt // 2
        cnt = 0
# print(*res)
for i in reversed(list(range(n))):
    if s[i] == "L":
        cnt += 1
    elif cnt > 0:
        res[i + 1] += (cnt + 1) // 2
        res[i] += cnt // 2
        cnt = 0
print((*res))

from collections import Counter, defaultdict, deque
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
import sys, math, itertools, fractions

sys.setrecursionlimit(10**8)
mod = 10**9 + 7
INF = float("inf")


def inp():
    return int(sys.stdin.readline())


def inpl():
    return list(map(int, sys.stdin.readline().split()))


s = eval(input())
n = len(s)
res = [0] * n
cnt = 0
now = [0, 0]
for i in range(n):
    if s[i] == "R":
        now[cnt % 2] += 1
        cnt += 1
    else:
        res[i - 1] += now[0]
        res[i] += now[1]
        now = [0, 0]
        cnt = 0
for i in range(n)[::-1]:
    if s[i] == "L":
        now[cnt % 2] += 1
        cnt += 1
    else:
        res[i + 1] += now[0]
        res[i] += now[1]
        now = [0, 0]
        cnt = 0
print((*res))

-from heapq import heappop, heappush, heapify -import sys, bisect, math, itertools, fractions, pprint +from heapq import heappop, heappush +from bisect import bisect_left, bisect_right +import sys, math, itertools, fractions -def inpln(n): -    return list(int(sys.stdin.readline()) for i in range(n)) - - +res = [0] * n -res = [0] * n -for i, t in enumerate(s): -    if t == "R": +now = [0, 0] +for i in range(n): +    if s[i] == "R": +        now[cnt % 2] += 1 -    elif cnt > 0: -        res[i - 1] += (cnt + 1) // 2 -        res[i] += cnt // 2 +    else: +        res[i - 1] += now[0] +        res[i] += now[1] +        now = [0, 0] -# print(*res) -for i in reversed(list(range(n))): +for i in range(n)[::-1]: +        now[cnt % 2] += 1 -    elif cnt > 0: -        res[i + 1] += (cnt + 1) // 2 -        res[i] += cnt // 2 +    else: +        res[i + 1] += now[0] +        res[i] += now[1] +        now = [0, 0]