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 devide_rl(s,n):
    tmp = "R"
    x = []
    y = []
    count = 0
    for i in range(n):
        if "R" == tmp and "L" == s[i]:
            count = i - 1
        else:
            pass

        if "L" == tmp and "R" == s[i]:
            y.append((x,count))
            x = []
            x.append(s[i])
            tmp = s[i]
        else:
            x.append(s[i])
            tmp = s[i]

    else:
        y.append((x,count))

    return y

def gathering_childern(s,n):
    y = devide_rl(s,n)
    ylen = len(y)
    ans = [0]*n
    last = 0
    for i in range(ylen):
        a,p= y[i]
        alen = len(a)
        rtotal, ltotal = 0, 0

        for j in range(last,last+alen):
            if p%2==j%2:
                rtotal += 1
            else:
                ltotal += 1
        last = j+1
        ans[p] = rtotal
        ans[p+1] = ltotal

    return ans


if __name__ == '__main__':
    s = raw_input()
    n = len(s)
    a = gathering_childern(s,n)

    for i in range(n):
        print(a[i]),
    print("")