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;

public class Main {

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

		    String s_original = sc.nextLine();
		    String[] s = s_original.split("",0);
		    int n = s.length;
		    int R_i = 0;
		    int L_i = 0;
		    int[] m = new int[n];
		    int flg =0;
		    int num1=0;
		    int num2=0;
		    for(int i=0;i<n;i++) {
		    	m[i]=0;
		    	if(s[i].equals("R")) {
		    		if(flg == 0) {
		    			flg=1;
		    			num1 += 1;
		    		}else if(flg == 1) {
		    			flg=0;
		    			num2+=1;
		    		}else if(flg==2) {
		    			m[R_i]+=num2;
		    			num2=0;
		    			m[L_i]+=num1;
		    			num1=1;
		    			R_i=0;
		    			L_i=0;
		    			flg=1;
		    		}else if(flg==3) {
		    			m[R_i]+=num2;
		    			num2=0;
		    			m[L_i]+=num1;
		    			num1=1;
		    			R_i=0;
		    			L_i=0;
		    			flg=1;
		    		}
		    	}else if(s[i].equals("L")) {
		    		if(flg==2) {
		    			flg=3;
		    			num2+=1;
		    		}else if(flg==3) {
		    			flg=2;
		    			num1+=1;
		    		}else if(flg==0){
		    			R_i = i-1;
		    			L_i = i;
		    			m[R_i]+=num2;
		    			num2=0;
		    			m[L_i]+=num1;
		    			num1=1;
		    			flg=2;
		    		}else if(flg==1) {
		    			R_i = i-1;
		    			L_i = i;
		    			m[R_i]+=num1;
		    			num1=1;
		    			m[L_i]+=num2;
		    			num2=0;
		    			flg=2;
		    		}
		    	}
		    }
		    m[R_i]+=num2;
			m[L_i]+=num1;
		    for(int i=0;i<n;i++) {
		    	System.out.print(m[i]+" ");
		    }

		    sc.close();
	}
}
