output_description: Print the number of children standing on each square after the children
  performed the moves, in order from left to right.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      S
attempt: # https://atcoder.jp/contests/abc136/tasks/abc136_d
  
  s = list(str(input()))
  n = len(s)
  t = []
  u = []
  v = [0] * n
  for i in range(n):
      if i == 0:
          for j in range(i, n):
              if s[j] == "L":
                  t.append(j - 1)
                  u.append(j - i - 1)
                  break
  
      else:
          if s[i] == s[i - 1]:
              t.append(t[i - 1])
              u.append(u[i - 1] + 1)
          elif s[i] == "R":
              for j in range(i, n):
                  if s[j] == "L":
                      t.append(j - 1)
                      u.append(j - i - 1)
                      break
          else:
  
              for j in reversed(range(i)):
                  if s[j] == "R":
                      t.append(j)
                      u.append(i - j)
                      break
              """
              t.append(i-1)
              u.append(0)
              """
      a = u[i] % 2
      v[t[i] + a] += 1
  
  
  print(" ".join(map(str, v)))
  
problem_description: Statement
  
  Given is a string S consisting of `L` and `R`.
  
  Let N be the length of S. There are N squares arranged from left to right, and
  the i-th character of S from the left is written on the i-th square from the
  left.
  
  The character written on the leftmost square is always `R`, and the character
  written on the rightmost square is always `L`.
  
  Initially, one child is standing on each square.
  
  Each child will perform the move below 10^{100} times:
  
    * Move one square in the direction specified by the character written in the square on which the child is standing. `L` denotes left, and `R` denotes right.
  
  Find the number of children standing on each square after the children
  performed the moves.
samples: [{"input": "RRLRL", "output": "0 1 2 1 1\n    \n\n  * After each child performed one move, the number of children standing on each square is 0, 2, 1, 1, 1 from left to right.\n  * After each child performed two moves, the number of children standing on each square is 0, 1, 2, 1, 1 from left to right.\n  * After each child performed 10^{100} moves, the number of children standing on each square is 0, 1, 2, 1, 1 from left to right.\n\n* * *"}, {"input": "RRLLLLRLRRLL", "output": "0 3 3 0 0 0 1 1 0 2 2 0\n    \n\n* * *"}, {"input": "RRRLLRLLRRRLLLLL", "output": "0 0 3 2 0 2 1 0 0 0 4 4 0 0 0 0"}]