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.next();
		int start = 0;	// Rの開始
		int end = 0;	// Lの次のRの位置

		int[] itg = new int[S.length()];

		while (start < S.length()) {
			int rl = start;		//	Rの次のLの位置
			for (; rl < S.length(); rl++) {
				if (S.charAt(rl) == 'L') {
					break;
				}
			}
			for (end = rl; end < S.length(); end++) {
				if (S.charAt(end) == 'R') {
					break;
				}
            }
			itg[rl] = (end - rl - 1) / 2 + (rl - start) / 2 + 1;	// end～rlの次の偶数離れ + rl～startの偶数離れ + 自分
			itg[rl - 1] = end - start - itg[rl];

			start = end;
		}

		for (int i : itg) {
			System.out.print(String.valueOf(i) + " ");
		}
		System.out.println();
	}
}