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: # -*- coding: utf-8 -*-
  """
  Created on Sun Apr 12 18:08:28 2020
  
  @author: Kanaru Sato
  """
  
  s = list(input())
  N = len(s)
  
  rf = 0
  lf = 0
  lis = []
  i = 0
  
  for i in range(N):
      if rf == 0 and s[i] == "R":
          if lf == 1:
              lf = 0
              lis.append(i - 1)
          lis.append(i)
          rf = 1
      elif rf == 1 and s[i] == "R":
          if s[i + 1] == "L":
              lis.append(i)
              rf = 0
          else:
              continue
      elif lf == 0 and s[i] == "L":
          if rf == 1:
              rf = 0
              lis.append(i - 1)
          lis.append(i)
          lf = 1
      elif lf == 1 and s[i] == "L":
          if i == N - 1:
              lis.append(i)
          else:
              if s[i + 1] == "R":
                  lis.append(i)
                  lf = 0
              else:
                  continue
  
  if len(lis) % 4 != 0:
      lis.append(lis[-1])
  
  ##print(lis)
  
  n = 0
  anslist = []
  for cell in range(N):
      if cell > lis[4 * n + 3]:
          n += 1
  
      In = lis[4 * n + 0]
      Jn = lis[4 * n + 1]
      Kn = lis[4 * n + 2]
      Ln = lis[4 * n + 3]
  
      if cell < Jn:
          ans = 0
      elif cell == Jn:
          ans = (Ln - Jn) // 2 + (Jn - In) // 2 + 1
      elif cell == Kn:
          ans = (Ln - Kn) // 2 + (Kn - In) // 2 + 1
      else:
          ans = 0
  
      anslist.append(ans)
  
  anslist = list(map(str, anslist))
  
  print(" ".join(anslist))
  
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"}]