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

public class Main {

    public static void main(String args[]) {

        // 入力
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        // 主処理
        String str = s.replace("LR", "L,R");
        String[] array = str.split(",");
        Deque<Integer> countR = new ArrayDeque<>();
        Deque<Integer> countL = new ArrayDeque<>();
        for (int i = 0; i < array.length; i++) {
            int count = array[i].length();
            if (count % 2 == 0) {
                int half = count / 2;
                countR.add(half);
                countL.add(half);
            } else {
                int r = array[i].replace("L", "").length();
                // int l = array[i].replace("R", "").length();
                if (r % 2 == 1) {
                    countL.add(count / 2);
                    countR.add((int) Math.ceil(count / 2.0));
                } else {
                    countR.add(count / 2);
                    countL.add((int) Math.ceil(count / 2.0));
                }
            }
        }
        int[] countArray = new int[s.length()];
        for (int i = 0; i < s.length() - 1; i++) {
            if (s.charAt(i) == 'R' && s.charAt(i + 1) == 'L') {
                countArray[i] = countR.poll();
                countArray[i + 1] = countL.poll();
                i++;
            }
        }

        String[] strArray = new String[s.length()];
        for (int i = 0; i < strArray.length; i++) {
            strArray[i] = Integer.toString(countArray[i]);
        }
        String result = String.join(" ", strArray);

        // 出力
        System.out.println(result);
        sc.close();
    }
}
