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.ArrayList;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		StringBuilder sb = new StringBuilder(sc.next());
		ArrayList<Integer> RAry = new ArrayList<>();
		ArrayList<Integer> LAry = new ArrayList<>();
		int n = sb.length();
		while(sb.length() != 0){
			int r = sb.indexOf("L");
			RAry.add(r);
			sb.delete(0, r);
			int l = sb.indexOf("R");
			if(l == -1){
				l = sb.length();
			}
			LAry.add(l);
			sb.delete(0, l);
		}
		int[] ans = new int[n];
		int index = 0;
		for(int i = 0; i < RAry.size(); i++){
			int r = RAry.get(i);
			int l = LAry.get(i);
			int sum = r + l;
			if(sum % 2 == 0){
				ans[index + r - 1] += sum /2;
				ans[index + r] += sum /2;
			}
			else{
				if(r % 2 == 0){
					ans[index + r - 1] += sum / 2;
					ans[index + r] += sum / 2 + 1;
					
				}
				else{
					ans[index + r - 1] += sum / 2 + 1;
					ans[index + r] += sum / 2;
				}
			}
			index += sum;
		}
		for(int num : ans){
			System.out.println(num);
		}
	}
}
