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
def main():
    s = [-1 if c == 'L' else 1 for c in raw_input()]
    n = len(s)
    lr = [-1]
    for i in xrange(0, n - 1):
        if s[i:i + 2] == [1, -1]:
            lr.append(i)
        elif s[i:i + 2] == [-1, 1]:
            lr.append(i)
    lr.append(n - 1)
    c = [0] * n
    for i in xrange(0, len(lr) - 1, 2):
        p = lr[i + 1]
        a = lr[i + 1] - lr[i]
        b = lr[i + 2] - lr[i + 1]
        c[p] += (a - a // 2) + b // 2
        c[p + 1] += a // 2 + (b - b // 2)
    print " ".join(map(str, c))


if __name__ == '__main__':
    main()
