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 {
    private static StringBuilder sb;
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        sb = new StringBuilder(s.length() * 3);
        int rc = 0;
        int lc = 0;
        for (int i = 0; i < s.length(); i++) {
            if (s.charAt(i) == 'R') {
                if (lc == 0) {
                    rc++;
                } else {
                    exec(rc, lc);
                    rc = 1;
                    lc = 0;
                }
            } else {
                lc++;
            }
        }
        exec(rc, lc);
        System.out.println(sb.substring(0, sb.length() -1));
    }
    private static void exec(int rc, int lc) {
        int sum = rc + lc;
        int half = sum / 2;
        if (sum % 2 == 0) {
            for(int i = 0; i < rc - 1; i++) {
                sb.append('0').append(' ');
            }
            sb.append(half).append(' ').append(half).append(' ');
            for(int i = 0; i < lc - 1; i++) {
                sb.append('0').append(' ');
            }
        } else {
            int rh = half;
            int lh = half;
            if (rc % 2 == 0) {
                lh += 1;
            } else {
                rh += 1;
            }
            for(int i = 0; i < rc - 1; i++) {
                sb.append('0').append(' ');
            }
            sb.append(rh).append(' ').append(lh).append(' ');
            for(int i = 0; i < lc - 1; i++) {
                sb.append('0').append(' ');
            }
        }
    }
}
