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

public class Main {
    int[] children;

    void solve() {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        int N = S.length();
        char[] LR = S.toCharArray();
        children = new int[N];
        Arrays.fill(children, 0);

        int start = 0; // RLブロックの左端
        int end = 0; // RLブロックの右端
        for (int i = 0; i <= N - 2; i++) {
            if (LR[i] == 'R' && LR[i + 1] == 'L') {
                for (int j = i + 1; j <= N - 1; j++) {
                    if (j == N - 1) {
                        end = j;
                        //start = i;
                        break;
                    }
                    if (LR[j] == 'R') {
                        end = j - 1;
                        // i = end;
                        break;
                    }
                }
                countChildren(i, start, end); // i は R の場所。
                i = end;
                start = end + 1;
                end = start; // 不要だが、start > end の状態は不自然なので、ここで是正しておく。
            }
        }

        for (int i = 0; i < N; i++) {
            System.out.print(children[i] + " ");
        }

    }
    void countChildren(int rPos, int start, int end) {
        int lPos = rPos + 1;
        int rPosChildrenNum = (rPos - start) / 2 + (end - rPos) / 2 + 1;
        int lPosChildrenNum = (lPos - start) / 2 + (end - lPos) / 2 + 1;
        children[rPos] = rPosChildrenNum;
        children[lPos] = lPosChildrenNum;
    }

    // Main
    public static void main(String[] args) {
        new Main().solve();
    }
}

