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;
import java.util.Arrays;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        int[] cntArray = new int[s.length()];
        int[] pre1CntArray = new int[s.length()];
        int[] pre2CntArray = new int[s.length()];

        //Arrays.fill(cntArray, 1);

        //printCntArray(cntArray);

        sortCntArray(s, cntArray);

        for (int i = 0; i < s.length(); i++) {
            pre2CntArray = pre1CntArray.clone();
            pre1CntArray = cntArray.clone();
            movePosition(s, cntArray, pre1CntArray);

            if (Arrays.equals(pre1CntArray, cntArray)) {
                printCntArray(cntArray);
                break;
            }

            if (Arrays.equals(pre2CntArray, cntArray)) {
                if ((i + 1) % 2 == 0) {
                    printCntArray(cntArray);
                } else {
                    printCntArray(pre1CntArray);
                }
                break;
            }
        }
    }

    public static void movePosition(String s, int[] cntArray, int[] prevCntArray) {

        for (int i = 0; i < s.length(); i++) {
            if (s.charAt(i) == 'R') {
                cntArray[i + 1] += prevCntArray[i];
                cntArray[i] -= prevCntArray[i];
            } else {
                cntArray[i - 1] += prevCntArray[i];
                cntArray[i] -= prevCntArray[i];
            }
        }
    }

    public static void printCntArray(int[] cntArray) {

        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < cntArray.length; i++) {
            sb.append(cntArray[i]);
            sb.append(" ");
        }
        System.out.println(sb);
    }

    public static void sortCntArray(String s, int[] cntArray) {

        char target = 0;
        int matchCnt = 0;
        for (int i = 0; i < s.length(); i += matchCnt) {
            target = s.charAt(i);
            matchCnt = 1;
            for (int j = i + 1; j < s.length(); j++) {
                if (s.charAt(j) == target) {
                    matchCnt++;
                } else {
                    break;
                }
            }

            if (matchCnt == 1) {
                cntArray[i] = matchCnt;
            } else {
                if (target == 'R') {
                    cntArray[i + (matchCnt - 2)] = (matchCnt / 2);
                    cntArray[i + (matchCnt - 1)] = (matchCnt % 2 == 0) ? (matchCnt / 2) : (matchCnt / 2) + 1;
                } else {
                    cntArray[i + 1] = (matchCnt / 2);
                    cntArray[i] = (matchCnt % 2 == 0) ? (matchCnt / 2) : (matchCnt / 2) + 1;
                }
            }
        }
    }
}
