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.Scanner;

public class Main {

    public static void main(String[] args) throws Exception {
        try (Scanner sc = new Scanner(System.in)) {
            String s = sc.next();
            int n = s.length();

            boolean[] ss = new boolean[n];
            for (int i = 0; i < n; i++) {
                if (s.charAt(i) == 'R') {
                    ss[i] = true;
                } else {
                    ss[i] = false;
                }
            }

            int[] c = new int[n];

            for (int i = 0; i < n; i++) {
                if (ss[i] == true) {
                    for (int j = i + 1; j < n; j++) {
                        if (ss[j] == false) {
                            c[j - 1] += (j - i + 1) / 2;
                            c[j] += (j - i) / 2;
                            i = j - 1;
                            break;
                        }
                    }
                } else {
                    for (int j = i + 1; j < n; j++) {
                        if (ss[j] == true || j == n - 1) {
                            c[i] += (j - i + 1) / 2;
                            c[i - 1] += (j - i) / 2;
                            i = j - 1;
                            break;
                        }
                    }
                }

                if (i == n - 1) {
                    for (int j = n - 2; j >= 0; j--) {
                        if (ss[j] == true) {
                            if ((i - j) % 2 == 1) {
                                c[j + 1]++;
                            } else {
                                c[j]++;
                            }
                            break;
                        }
                    }
                }
            }

            System.out.print(c[0]);
            for (int i = 1; i < n; i++) {
                System.out.print(" " + c[i]);
            }
        }
    }

}
