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.io.*;
import java.util.*;
public class Main {

	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		char[] s = br.readLine().toCharArray();
		int n = s.length;
		boolean[] gat = new boolean[n];
		for(int i = 0; i < n-1; i++){
			if(s[i] == 'R' && s[i+1] == 'L'){
				gat[i] = true;
			}
		}
		int[] res = new int[n];
		int c = 0, d = 0;
		for(int i = 0; i < n-1; i++){
			if(s[i] == 'R'){
				if(i % 2 == 0) c++;
				else d++;
			}
			if(gat[i]){
				if(i % 2 == 0){
					res[i] += c; res[i+1] += d;
				}
				else{
					res[i] += d; res[i+1] += c;
				}
				c = 0; d = 0;
			}
		}
		c = 0; d = 0;
		for(int i = n-1; i >= 0; i--){
			if(s[i] == 'L'){
				if(i % 2 == 0) c++;
				else d++;
			}
			if(gat[i]){
				if(i % 2 == 0){
					res[i] += c; res[i+1] += d;
				}
				else{
					res[i] += d; res[i+1] += c;
				}
				c = 0; d = 0;
			}
		}
		StringBuilder sb = new StringBuilder();
		for(int k: res){
			sb.append(k+" ");
		}
		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
		bw.write(sb.toString().trim());
		bw.write("\n");
		bw.flush();
	}

}
