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 {

    static int gcd (int a, int b) {return b>0?gcd(b,a%b):a;}
    static long mod = 1000000007;

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

        int point =0;
        int rCount =0;
        int lCount =0;
        boolean rCounting = true;
        int[] ans = new int[S.length];
        for(int i=0;i<S.length;i++){

            if(i>0 && S[i] == 'R' && S[i-1] == 'L'){
                ans[point-1] = (rCount +1)/2 + lCount/2;
                ans[point] = (lCount+1)/2 + rCount/2;
                rCounting = true;
                rCount = 1;
                lCount = 0;

            } else if(i>0 && S[i] == 'L' && S[i-1] == 'R'){
                point = i;
                rCounting = false;
                lCount = 1;


            } else {
                if(rCounting){
                    rCount++;
                } else {
                    lCount++;
                }

            }

            if(i == S.length-1) {
                ans[point-1] = (rCount +1)/2 + lCount/2;
                ans[point] = (lCount+1)/2 + rCount/2;
            }

        }

        for(int a: ans){
            System.out.print(a + " ");

        }


    }

}


