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 java.util.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String [] args) {
        Scanner scanner = new Scanner(System.in);
        String s = scanner.next();
        int rLeft = 0;
        int rRight = 0;
        int [] number = new int[s.length()];
        for (int i = 1; i < s.length(); ++i) {
            if (s.charAt(i) == 'R') {
                if (rLeft == -1) {
                    rLeft = i;
                    rRight = i;
                } else {
                    rRight++;
                }
            } else {
                if (rLeft == -1) {
                    continue;
                }
                int index1 = (rRight - rLeft) % 2 + rRight;
                int index2 = (rRight - rLeft + 1) % 2 + rRight;
                number[index1] += (rRight - rLeft + 1) - (rRight - rLeft + 1) / 2;
                number[index2] += (rRight - rLeft + 1) / 2;


                rLeft = -1;
                rRight = -1;
            }
        }

        int lLeft = s.length() - 1;
        int lRight = s.length() - 1;
        for (int i = s.length() - 2; i >= 0; --i) {
            if (s.charAt(i) == 'L') {
                if (lRight == -1) {
                    lRight = i;
                    lLeft = i;
                } else {
                    lLeft--;
                }
            } else {
                if (lRight == -1) {
                    continue;
                }
                int index1 = lLeft - (lRight - lLeft) % 2 ;
                int index2 = lLeft - (lRight - lLeft + 1) % 2;
                number[index1] += (lRight - lLeft + 1) - (lRight - lLeft + 1) / 2;
                number[index2] += (lRight - lLeft + 1) / 2;

                lLeft = -1;
                lRight = -1;

            }
        }

        for (int i = 0; i < s.length(); ++i) {
            System.out.print(number[i] + " ");
        }
        System.out.println();
    }
}
