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.*;
import java.util.stream.*;

public class Main {
	Scanner sc;
	String S;
	int[] count;
	
//=============
// constructor
//
	public Main() {
		sc = new Scanner(System.in);
	}
	
//==================
// instance methods
//
	/**
	 * アルゴリズム本体
	 */
	private void calc() {
		S = sc.next();
		count = new int[S.length()];
		for (int i = 0; i < S.length();) {
			int j;
			for (j = i; j < S.length(); j++) {
				if (S.charAt(j) == 'L') break;
			}
			for (int k = i; k < j; k++) {
				if ( (j-k)%2 == 0 ) count[j]++;
				else count[j-1]++;
			}
			i = j;
			if (i >= S.length()) break;
			for (j = i+1; j < S.length(); j++) {
				if (S.charAt(j) == 'R') break;
			}
			for (int k = i; k < j; k++) {
				if ( (k-i)%2 == 0 ) count[i]++;
				else count[i-1]++;
			}
			i = j;
		}
		out(IntStream.of(count)
					.mapToObj(c -> String.valueOf(c))
					.collect(Collectors.joining(" ")));
	}
	
	private void out(Object o) {
		System.out.println(o);
		System.out.flush();
	}
	
//======
// main
//
	public static void main(String[] args) {
		Main m = new Main();
		m.calc();
	}

}