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) {
		// TODO Auto-generated method stub
		Scanner scn=new Scanner(System.in);
		String str = scn.next();
		int []arr=new int[str.length()];
		for(int i=0,j=str.length()-1;i<str.length()&&j>=0;i++,j--) {
			if( str.charAt(i)=='R') {
				if(i>0&&str.charAt(i-1)=='R') {
					arr[i]=arr[i-1]+1;
					arr[i-1]=0;
				}else {
					arr[i]=1;
				}
			}
			if(str.charAt(j)=='L') {
				if(j<str.length()-1&&str.charAt(j+1)=='L') {
					arr[j]=arr[j+1]+1;
					arr[j+1]=0;
				}else {
					arr[j]=1;
				}
			}
		}
//		for(int i=0;i<str.length();i++) {
//			System.out.print(arr[i]+" ");
//		}
//		System.out.println();
		int flag=0;
		for(int i=0;i<str.length();i++) {
			flag=0;
			if(i+1<str.length()&&str.charAt(i)=='R'&&str.charAt(i+1)=='L') {
				int x=Integer.max(arr[i], arr[i+1])-Integer.min(arr[i], arr[i+1]);
				if((Integer.max(arr[i], arr[i+1])-1)%2!=0) {
					flag=1;
					
				}
				if(arr[i]<arr[i+1]) {
					arr[i]+=x/2;
					arr[i+1]-=x/2;
				}else {
					arr[i+1]+=x/2;
					arr[i]-=x/2;
				}
				if(flag==1) {
					int temp=arr[i];
					arr[i]=arr[i+1];
					arr[i+1]=temp;
				}
				
			}
		}
		for(int i=0;i<str.length();i++) {
			System.out.print(arr[i]+" ");
		}
	}

}
