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

			int num1 = 0;
			int num2 = 0;
			int rNum = 0;
			int lNum = 0;
			boolean isR = true;
			for (int i = 0; i < s.length(); i++) {
				char c = s.charAt(i);
				switch(c) {
				case 'R':
					if(isR) {
	 					if(i % 2 == 0) {
							num1++;
						} else {
							num2++;
						}
					} else {
						if(rNum % 2 == 0) {
							arr[rNum] = num1;
							arr[lNum] = num2;
						} else {
							arr[rNum] = num2;
							arr[lNum] = num1;
						}
						num1 = 0;
						num2 = 0;
						isR = true;
	 					if(i % 2 == 0) {
							num1++;
						} else {
							num2++;
						}
					}
					break;
				case 'L':
					if(isR) {
						rNum = i - 1;
						lNum = i;
						isR = false;
					}
 					if(i % 2 == 0) {
						num1++;
					} else {
						num2++;
					}
				}
			}
			if(rNum % 2 == 0) {
				arr[rNum] = num1;
				arr[lNum] = num2;
			} else {
				arr[rNum] = num2;
				arr[lNum] = num1;
			}

			boolean isFirst = true;
			for (int i : arr) {
				if (!isFirst) {
					System.out.print(" ");
				}
				System.out.print(i);
				isFirst = false;
			}
			System.out.println();
		}
	}
}
