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 = sc.nextLine();
		char c[] = s.toCharArray();
		int n = 1;
		for (int i = 0; i < s.length() - 1; i++) {
			if (c[i] != c[i + 1]) {
				n++;
			}
		}
		int x[] = new int[n];
		Renzoku(c, x);
int y[]=new int[x.length/2];
y[0]=x[0]-1;
for(int i=1;i<y.length;i++){
	y[i]=y[i-1]+x[2*i]+x[2*i-1];
}

int mark=0;
for(int i=0;i<c.length;i++){
if(i!=y[mark]){
	System.out.print(0+" ");
}else{
	int ans=(x[mark*2]/2)+(x[mark*2]%2)+(x[mark*2+1]/2);
	int ans2=(x[mark*2]/2)+(x[mark*2+1]%2)+(x[mark*2+1]/2);
	System.out.print(ans+" ");
	System.out.print(ans2+" ");
	mark++;
	if(mark>=y.length){
		mark--;
	}
	i++;
}
}

System.out.println();
	}

	public static int Renzoku(char c[], int x[]) {

		int mode = 0;
		int val = 0;

		for (int i = 0; i <= c.length - 2; i++) {
			if ((c[i] == c[i + 1]) && i != c.length - 2) {
				val++;
			} else {
				if ((c[i] == c[i + 1]) && i == c.length - 2) {
					val++;
				}
				val++;
				x[mode] = val;
				mode++;

				if ((c[i] != c[i + 1]) && i == c.length - 2) {
					x[mode] = 1;
					mode++;
				}

				val = 0;
			}

		}
		return mode;

	}
	static void show(int x[]){
		for(int i=0;i<x.length;i++){
			System.out.print(x[i]+" ");
		}
		System.out.println();
	}
}
