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.

Constraints

* S is a string of length between 2 and 10^5 (inclusive).
* Each character of S is `L` or `R`.
* The first and last characters of S are `R` and `L`, respectively.

Input

Input is given from Standard Input in the following format:


S


Output

Print the number of children standing on each square after the children performed the moves, in order from left to right.

Examples

Input

RRLRL


Output

0 1 2 1 1


Input

RRLLLLRLRRLL


Output

0 3 3 0 0 0 1 1 0 2 2 0


Input

RRRLLRLLRRRLLLLL


Output

0 0 3 2 0 2 1 0 0 0 4 4 0 0 0 0
import sys
from pprint import pprint

def solve(s):

  len_s = len(s)
  
  r = 0
  l = 0
  pos = [0] * len_s
  last_r_pos = 0
  for i in xrange(len_s):
    # print "l:",l,"r:",r,"last_r:",last_r_pos
    if s[i] == "R":
      if r == 0 and l > 0:
        if l % 2 == 0:
          pos[last_r_pos] += l / 2
          pos[last_r_pos + 1] += l / 2
        else:
          pos[last_r_pos] += l / 2 + 1
          pos[last_r_pos + 1] += l / 2
        l = 0
      last_r_pos = i
      r += 1

    elif s[i] == "L":
      if r > 0:
        if r % 2 == 0:
          pos[i] += r / 2
          pos[i-1] += r / 2
        else:
          pos[i] += r / 2
          pos[i-1] += r / 2 + 1
        pos[i] += 1
        r = 0
      else:
        l += 1
        r = 0

  if l > 0:
    if l % 2 == 0:
      pos[last_r_pos] += l / 2
      pos[last_r_pos + 1] += l / 2
    else:
      pos[last_r_pos] += l / 2 + 1
      pos[last_r_pos + 1] += l / 2

  # pprint(pos)
  print " ".join(map(str, pos))


if __name__ == '__main__':

  s = sys.stdin.readline().strip()
  solve(s)