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()
  target = []
  split = 0
  for i in range(1, len(S)):
      if S[i - 1] != S[i] and S[i] == "L":
          continue
      if S[i - 1] != S[i] and S[i] == "R":
          target.append(S[split:i])
          split = i
          continue
  target.append(S[split : len(S)])
  # print(target)
  
  result = []
  for t in target:
      ans = [0] * len(t)
      # ans[t.count('R')-1] = (t.count('R')//2 if t.count('R')//2 !=0 else 1 ) + (t.count('L')//2 if t.count('L')//2 !=0 else 0)
      # ans[t.count('R')] = (t.count('R')//2  if t.count('R') //2 !=0 else 0 )+ (t.count('L')//2 if t.count('L')//2 != 0 else 1)
      # ans[t.count('R')-1] = (t.count('R')//2 ) + (t.count('L')//2 )
      # print(t.count('R')//2)
      # ans[t.count('R')] = (t.count('R')//2 )+ (t.count('L')//2 )
      if t.count("R") == 1 and t.count("L") == 1:
          ans[t.count("R") - 1] = 1
          ans[t.count("R")] = 1
      elif t.count("R") == 1 and t.count("L") != 1:
          ans[t.count("R") - 1] = 1 + t.count("L") // 2
          ans[t.count("R")] = -(-(t.count("L")) // 2)
      elif t.count("R") != 1 and t.count("L") == 1:
          ans[t.count("R") - 1] = -(-(t.count("R")) // 2)
          ans[t.count("R")] = 1 + t.count("R") // 2
      elif t.count("R") != 1 and t.count("L") != 1:
          ans[t.count("R") - 1] = -(-(t.count("R")) // 2) + (t.count("L")) // 2
          ans[t.count("R")] = t.count("R") // 2 + -(-(t.count("L")) // 2)
      # print(ans)
      result.extend(ans)
  for r in result:
      print(r, end=" ")
  
  
  """
  for i,s in enumerate(S):
      if pre == 'L':
          pre = 'L'
      if pre == 'R' and i !=0:
          pre = 'R'
          target.append(S[split:i-1])
          split = i-1
  print(target)
  """
  
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"}]