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.*;
import java.io.*;

class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);

        String S = sc.next();
        sc.close();

        int N = S.length();
        char[] s = new char[N];
        s = S.toCharArray();
        long[] num = new long[N];
        for (int i = 0; i < N; i++) {
            num[i] = 1;
        }

        long[] list = new long[N];
        long[] sum = new long[2];
        int rStart = 0;
        int rEnd = 0;
        int lStart = 0;
        for (int i = 0; i < N; i++) {
            sum[(i - rStart) % 2] += num[i];
            if (s[i] == 'L') {
                if (i > 0 && s[i-1] == 'R') {
                    rEnd = i - 1;
                    lStart = i;
                }
                if (i + 1 == N || s[i+1] == 'R') {
                    if ((rEnd - rStart) % 2 == 0) {
                        list[rEnd] = sum[0];
                        list[lStart] = sum[1];
                    } else {
                        list[rEnd] = sum[1];
                        list[lStart] = sum[0];
                    }
                    sum[0] = 0;
                    sum[1] = 0;
                    rStart = i + 1;
                }
            }
        }

        for (int i = 0; i < N; i++) {
            if (i != 0) {
                out.printf(" ");
            }
            out.printf("%d", list[i]);
        }
        out.printf("\n");
        out.flush();
    }
}
