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()
  n = len(s)
  kodomo = [0 for i in range(n)]
  cr1 = 0
  cr2 = 0
  rflag = False
  rlflag = False
  for i in range(n):
      if s[i] == "R":
          rlflag = False
          if rflag:
              cr2 += 1
              rflag = False
          else:
              cr1 += 1
              rflag = True
      else:
          if rlflag:
              continue
          else:
              rlflag = True
              if rflag:
                  kodomo[i - 1] += cr1
                  kodomo[i] += cr2
                  cr1 = 0
                  cr2 = 0
              else:
                  kodomo[i - 1] += cr2
                  kodomo[i] += cr1
                  cr1 = 0
                  cr2 = 0
          rflag = False
  
  cl1 = 0
  cl2 = 0
  lflag = False
  lrflag = False
  for i in range(n):
      if s[n - 1 - i] == "L":
          lrflag = False
          if lflag:
              cl2 += 1
              lflag = False
          else:
              cl1 += 1
              lflag = True
      else:
          if lrflag:
              continue
          else:
              lrflag = True
              if lflag:
                  kodomo[n - i] += cl1
                  kodomo[n - i - 1] += cl2
                  cl1 = 0
                  cl2 = 0
              else:
                  kodomo[n - i] += cl2
                  kodomo[n - i - 1] += cl1
                  cl1 = 0
                  cl2 = 0
          lflag = False
  print(" ".join(map(str, kodomo)))
  
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"}]