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: import sys
  
  input = sys.stdin.readline
  S = list(input())[:-1]
  rtable = [1]
  ltable = [0]
  N = len(S)
  for i in range(1, N):
      if S[i - 1] == "L" and (S[i] == "R"):
          rtable.append(1)
          ltable.append(0)
      elif S[i] == "R":
          rtable[-1] += 1
      else:
          ltable[-1] += 1
  
  lrtable = []
  
  for i in range(N - 1):
      if S[i] == "R" and (S[i + 1] == "L"):
          lrtable.append(i)
  
  # print(lrtable)
  # print(ltable, rtable)
  res = [0] * N
  for i in range(len(lrtable)):
      x = lrtable[i]
      y = -(-ltable[i] // 2)
      z = -(-rtable[i] // 2)
  
      l = z + (ltable[i] - y)
      r = y + (rtable[i] - z)
      res[x] = l
      res[x + 1] = r
  print(*res)
  
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"}]