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 scan = new Scanner(System.in);
        String S = scan.next();
        ArrayList<String> Sa = new ArrayList<String>();

        int prev = 0;
        for(int i=0;i<S.length()-1;i++){
            if(S.charAt(i) == 'R' && S.charAt(i+1) == 'L'){
                for(int j=i+1;j<S.length();j++){
                    if(S.charAt(j) == 'R'){
                        String str = S.substring(prev,j);
                        Sa.add(str);
                        prev = j;
                        break;
                    }else if(j == S.length()-1){
                        String str = S.substring(prev,S.length());
                        Sa.add(str);
                        prev = i+j;                        
                        break;
                    }
                }
            }
        }

        for(int i=0;i<Sa.size();i++){
            String str = Sa.get(i);
            int len = str.length();
            int index = str.indexOf("RL");

            boolean flag = false;
            if((str.substring(0,index).length())%2==1 && (str.substring(index+1,str.length()-1).length())%2==0)
                flag = true;
            else
                flag = false;

            if((len % 2) == 0){
                for(int j=0;j<len;j++){
                    if(j == index || (j == index+1)){
                        System.out.print((len/2) + " ");
                    }else{
                        System.out.print(0 + " ");                        
                    }
                }
            }else{
                for(int j=0;j<len;j++){
                    if(j == index){
                        if(flag)
                            System.out.print((len/2) + " ");
                        else
                            System.out.print((len/2)+1 + " ");
                    }else if(j == index + 1){
                        if(flag)
                            System.out.print((len/2)+1 + " ");
                        else
                            System.out.print((len/2) + " ");
 
                    }else{
                        System.out.print(0 + " ");                        
                    }
                }
            }
        }
    }
}
