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 in = new Scanner(System.in);

		char[] s = in.next().toCharArray();

		int idx = 0;
		while ( idx < s.length ) {
			// Rの個数をカウント
			int cntR = 0;
			while ( idx < s.length && s[idx] == 'R' ) {
				cntR++;
				idx++;
			}

			// Rの連続がLに移行したポイントを記録 s[changePoint -1] = R, s[changePoint] = L,
			int changePoint = cntR;
			// System.out.println("cp is " + changePoint);

			// Lの個数をカウント
			int cntL = 0;
			while ( idx < s.length && s[idx] == 'L' ) {
				cntL++;
				idx++;
			}

			// System.out.println("(cntR + cntL) % 2 =" + (cntR + cntL) % 2);

			// 表示
			if ( (cntR + cntL) % 2 == 0 ) {
				for ( int i = 0; i < cntR + cntL; i++ ) {
					if ( i == changePoint - 1 || i == changePoint ) {
						System.out.print((cntR + cntL) / 2 + " ");
					} else {
						System.out.print(0 + " ");
					}
				}
			} else {
				for ( int i = 0; i < cntR + cntL; i++ ) {
					if ( i != changePoint - 1 && i != changePoint ) {
						System.out.print(0 + " ");

					} else
					// R	
					if ( i != changePoint - 1 ) {

						if ( (changePoint - 1) % 2 == (cntR + cntL) % 2 ) {
							System.out.print(((cntR + cntL) / 2 + 1) + " ");
						} else {
							System.out.print((cntR + cntL) / 2 + " ");
						}
					} else
					// L	
					if ( i != changePoint ) {

						if ( (changePoint) % 2 == (cntR + cntL) % 2 ) {
							System.out.print(((cntR + cntL) / 2 + 1) + " ");
						} else {
							System.out.print((cntR + cntL) / 2 + " ");
						}
					}
				}
			}
		}

		in.close();

	}
}