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.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.util.*;
 
public class Main {
    public static final Scanner in = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
    public static final PrintStream out = System.out;
 
    public static void main(String[] args) {
        String S = in.next();
        int N = S.length();
 
        int l = 0, c = 0;
        int[] result = new int[N];
        for (int i = 1; i < N; i++) {
            if (S.charAt(i) == 'R' && S.charAt(i - 1) == 'L') {
                int L = c - l, R = i - c;
                System.err.println("l: " + l + ", c: " + c + "L: " + L + ", R: " + R);
 
                result[c - 1] += L / 2 + L % 2;
                result[c - 1] += R / 2;
                result[c] += L / 2;
                result[c] += R / 2 + R % 2;
 
                l = i;
            } else if (S.charAt(i) == 'L' && S.charAt(i - 1) == 'R') {
                c = i;
            }
        }
 
        int L = c - l, R = N - c;
        System.err.println("l: " + l + "c: " + c + "L: " + L + ", R: " + R);
 
        result[c - 1] += L / 2 + L % 2;
        result[c - 1] += R / 2;
        result[c] += L / 2;
        result[c] += R / 2 + R % 2;
 
        for (int i : result) {
            out.print(i);
            out.print(" ");
        }
    }
}