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) {
		try(Scanner scan = new Scanner(System.in)){
			
			String S = scan.next();
			char[]s = new char[S.length()];
			s = S.toCharArray();
			
			int []goukei = new int[S.length()];
			int []R = new int[S.length()];
			int []L = new int[S.length()];
			
			int Rcount = 0;
			for(int i = S.length()-1;i>=0;i--) {
				if(s[i]=='L') {
					Rcount = 0;
					R[i] = Rcount;
				}else if(s[i] =='R') {
					Rcount++;
					R[i] = Rcount;
				}	
			}
			
			for(int i = 0;i<S.length();i++) {
				if(R[i]!=0) {
					if(R[i]%2==0) {//偶数
						goukei[i+R[i]]++;
					}else{//奇数
						goukei[i+R[i]-1]++;
					}
				}
			}
			
			
			int Lcount = 0;
			for(int i = 0;i<S.length();i++) {
				if(s[i]=='R') {
					Lcount = 0;
					L[i] = Lcount;
				}else if(s[i] =='L') {
					Lcount++;
					L[i] = Lcount;
				}	
			}
			
			for(int i = 0;i<S.length();i++) {
				if(L[i]!=0) {
					if(L[i]%2==0) {//偶数
						goukei[i-L[i]]++;
					}else{//奇数
						goukei[i-L[i]+1]++;
					}
				}
			}
			
			for(int i = 0;i<S.length();i++) {
				System.out.print(goukei[i]);
				System.out.print(" ");
			}
			
			
			
		}
	}
}
