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: S = input()
  
  score = [0 for _ in range(len(S))]
  
  # s
  previous_l = 0
  for index in range(len(S)):
      if S[index] == "L":
          if previous_l + 1 < index:
              # L
              score[index] += (index - previous_l) // 2
              # R
              score[index - 1] += (index - previous_l - 1) // 2
          previous_l = index + 1
  
  # print(score)
  previous_r = len(S) - 1
  for index in reversed(range(len(S))):
      if S[index] == "R":
          if previous_r - 1 > index:
              score[index] += (previous_r - index) // 2
              score[index + 1] += (previous_r - index - 1) // 2
          previous_r = index - 1
  
  # print(score)
  # LR
  for index in range(len(S)):
      if S[index] == "R" and S[index + 1] == "L":
          score[index] += 1
          score[index + 1] += 1
  print(" ".join(map(str, score)))
  
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"}]