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: # print('RRRLLRL'.index('LR'))
  # print('RRRLLRLR'.index('LR'))
  # =>4
  # str.index(検索文字列,開始位置,終了位置)
  
  # indexは見つからないとエラー
  # findは見つからないと-1を出力
  
  # s='RRLRLR'
  # bubun=s[0:3]
  # print(bubun)
  # =>RRL
  
  
  def stateRL(s):
      state = [0] * len(s)
      r = s.count("R")
      l = s.count("L")
      state[r - 1] = 1 + (r - 1) // 2 + l // 2
      state[r] = 1 + r // 2 + (l - 1) // 2
      return state
  
  
  s = input()
  n = len(s)
  
  state = []
  
  kireme = -1
  nkireme = s.find("LR", 0)
  
  while nkireme != -1:
      bubun = s[kireme + 1 : nkireme + 1 :]
      state += stateRL(bubun)
      kireme = nkireme
      nkireme = s.find("LR", kireme + 1)
  
  bubun = s[kireme::]
  state += stateRL(bubun)
  
  for i in range(n):
      print(state[i], end=" ")
  
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"}]