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()
  start_posi = [int(i) for i in range(len(S))]
  cnt = 0
  
  posi = start_posi
  pre_posi = {}
  next_posi = start_posi
  while not posi in pre_posi.values():
      pre_posi[cnt] = next_posi
      next_posi = []
      for i in posi:
          next_posi.append(i + 1 if S[i] == "R" else i - 1)
      posi = next_posi
      cnt += 1
  print(cnt)
  for key, v in pre_posi.items():
      if posi == v:
          loop_width = cnt - key
          loop_point = key
          break
  loop = (10**100 - loop_point) % loop_width
  print(pre_posi)
  print(pre_posi[loop + loop_point])
  
  answer_dict = {i: 0 for i in range(len(S))}
  for mass in pre_posi[loop + loop_point]:
      answer_dict[mass] += 1
  print(" ".join(map(str, answer_dict.values())))
  
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"}]