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.*;

public class Main{
	public static void main(String[] args) throws Exception{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String s = br.readLine();
		int i, all, tmp;
		int n = s.length();
		int[] result = new int[n];

		for(i=0; i<n-1; i++){
			if( s.charAt(i) == 'R' && s.charAt(i+1) == 'L' ){
				tmp = countLeftR(s, i);
				all = tmp + countRightL(s, i+1, n);
				result[i] = result[i+1] = all/2;
				if( all % 2 == 1 ){
					if( tmp % 2 == 0 )
						result[i+1]++;
					else
						result[i]++;
				}
			}
		}

		System.out.print(result[0]);
		for(i=1; i<n; i++)
			System.out.print(" " + result[i]);
		System.out.println();
	}

	public static int countLeftR(String s, int pos){
		int count = 0;
		for(int i=pos; 0<=i && s.charAt(i) == 'R'; i--)
			count++;
		return count;
	}

	public static int countRightL(String s, int pos, int n){
		int count = 0;
		for(int i=pos; i<n && s.charAt(i) == 'L'; i++)
			count++;
		return count;
	}
}
