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

public class Main {

	public static void main(String[] args) throws Exception {
		// TODO 自動生成されたメソッド・スタブ
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		String W = in.readLine();

		long[] ans = new long[W.length()];
		Arrays.fill(ans, 0);
		int indexL=0;
		int indexR=0;

		long countR=0;
		long countL=0;

		long befIndx=0;
		for(int i=0;i<W.length();i++){

			if(i!=0 && W.charAt(i)=='R' && W.charAt(i-1)=='L'){
				if((countL+countR)%2==0){
					ans[indexR]=(countL+countR)/2;
					ans[indexL]=(countL+countR)/2;
				}else{
					if((indexR-befIndx)%2==1){
						//RLのRが奇数の場合
						ans[indexR]=(countR+countL)/2 ;
						ans[indexL]=(countR+countL)/2 +1;
					}else{
						ans[indexR]=(countR+countL)/2 +1;
						ans[indexL]=(countR+countL)/2 ;

					}
				}

				countR=0;
				countL=0;
				befIndx=i;
			}

			if(W.charAt(i)=='R'){
				countR++;
				indexR=i;
			}else{
				countL++;
				indexL=indexR+1;
			}
		}

		if((countL+countR)%2==0){
			ans[indexR]=(countL+countR)/2;
			ans[indexL]=(countL+countR)/2;
		}else{
			if((indexR-befIndx)%2==1){
				//RLのRが奇数の場合
				ans[indexR]=(countR+countL)/2 ;
				ans[indexL]=(countR+countL)/2 +1;
			}else{
				ans[indexR]=(countR+countL)/2 +1;
				ans[indexL]=(countR+countL)/2 ;

			}
		}

		StringBuffer sb = new StringBuffer();
		for(int i=0;i<ans.length;i++){
			sb.append(ans[i]+" ");
		}
		sb.deleteCharAt(sb.length()-1);

		System.out.println(sb.toString());
	}
}
