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()
  list1 = list(S)
  
  list2 = [0 for i in range(len(list1))]
  
  t = 0  # 現在地
  coutR = 0
  coutL = 0
  RLsindex = 0
  
  
  def countLnum(t, coutL):
      if t + 2 >= len(list1):
          return coutL
      elif list1[t + 2] == "R":
          return int(coutL)
      else:
          coutL = countLnum(t + 1, coutL + 1)
          return coutL
  
  
  def RLstart(t, coutL):
      list2[t] += 1
      list2[t + 1] += 1  # RL部分の初期値はそのままループし続ける
      if coutR % 2 == 0:
          list2[t] += int(coutR / 2)
          list2[t + 1] += int(coutR / 2)
      else:
          list2[t] += int(coutR / 2 - 0.5)
          list2[t + 1] += int(coutR / 2 + 0.5)
      if coutL % 2 == 0:
          list2[t] += int(coutL / 2)
          list2[t + 1] += int(coutL / 2)
      else:
          list2[t] += int(coutL / 2 + 0.5)
          list2[t + 1] += int(coutL / 2 - 0.5)
  
  
  while t < len(list1):
      if list1[t] == "R":
          if list1[t + 1] == "R":
              coutR += 1
              t += 1
          elif list1[t + 1] == "L":
              coutL = countLnum(t, 0)
              RLstart(t, coutL)
              t += 2 + coutL
              coutR, coutL = 0, 0
  s = ""
  for i in range(len(list2)):
      s += str(list2[i]) + " "
  print(s)
  
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"}]