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.*;

public class Main {
	double EPS = 10.e-08;
	private void doit(){
		Scanner sc = new Scanner(System.in);
		while(sc.hasNext()){
			char [] data = sc.next().toCharArray();
			int n = data.length;
			int [] res = new int[n];
			// count L
			int count = 0;
			int rind = 0;
			for(int i =0; i < n; i++){
				if(data[i] == 'R') {
					rind = i;
					count =0;
				}
				else {
					count++;
					if(count % 2 == 0){
						res[rind]++;
					}
					else{
//						debug(rind);
						res[rind+1]++;
					}
				}
			}
//			debug(res);
			// count R
			count = 0;
			int lind = n-1;
			for(int i =n-1; i >= 0; i--){
				if(data[i] == 'L') {
					lind = i;
					count =0;
				}
				else {
					count++;
					if(count % 2 == 0){
						res[lind]++;
					}
					else{
						res[lind-1]++;
					}
				}
			}
			StringBuilder sb = new StringBuilder();
			for(int i = 0; i < n; i ++){
				sb.append(" " + res[i]);
			}
			System.out.println(sb.substring(1));
		}
	}

	private void debug(Object... o) {
		System.out.println("debug = " + Arrays.deepToString(o));
	}

	public static void main(String[] args) {
		new Main().doit();
	}

}
