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 sc = new Scanner(System.in);
		String s = sc.next();
		int length = s.length();
		int[] ans = new int[100000];

		int Rs = 0;
		int Ls = 0;
		int changeid = -1;
		Boolean flag = true;

		for(int i = 0 ; i < length-1 ; i++){
			if(flag){
				if(s.charAt(i) == 'R'){
					Rs++;
				}else{
					Ls++;
					changeid = i-1;
					flag = false;
				}
			}else{
				if(s.charAt(i) == 'R'){

					if(((Rs+Ls)&1) == 0){
						ans[changeid] = (Rs+Ls)/2;
						ans[changeid+1] = (Rs+Ls)/2;
					}else{
						if((Rs&1) == 0){
							ans[changeid] = (Rs+Ls-1)/2;
							ans[changeid+1] = (Rs+Ls+1)/2;
						}else{
							ans[changeid] = (Rs+Ls+1)/2;
							ans[changeid+1] = (Rs+Ls-1)/2;
						}
					}

					Rs = 0;
					Ls = 0;
					flag = true;
					changeid = i;
					Rs++;
				}else{
					Ls++;
				}
			}
		}

		{
			Ls++;
			if(flag){
				changeid = length-2;
			}else{

			}
			if(((Rs+Ls)&1) == 0){
				ans[changeid] = (Rs+Ls)/2;
				ans[changeid+1] = (Rs+Ls)/2;
			}else{
				if((Rs&1) == 0){
					ans[changeid] = (Rs+Ls-1)/2;
					ans[changeid+1] = (Rs+Ls+1)/2;
				}else{
					ans[changeid] = (Rs+Ls+1)/2;
					ans[changeid+1] = (Rs+Ls-1)/2;
				}
			}
		}
		StringBuilder val = new StringBuilder();
		for(int i = 0 ; i < length-1 ; i++){
			val.append(""+ans[i]+" ");
		}
		val.append(""+ans[length-1]);
		System.out.println(new String(val));
	}

}