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) {
		Main mainObj = new Main();
		mainObj.solve();
	}
	
	public void solve() {
		
		Scanner sc = new Scanner(System.in);
		String sequence = sc.nextLine();
		sc.close();
		
		
		int rCount = 0;
		int lCount = 0;
		int[] childCntArr = new int[2];
		
		StringBuilder resultBuilder = new StringBuilder();
		
		int childCnt = 0;
		
		// 0 or 1 
		int rIndex = 0;
		// 0 or 1
		int lIndex = 0;
		
		char beforeChar = 'R';
		childCntArr[0] = 1;
		childCnt++;
		rCount++;
		
		for(int i = 1; i < sequence.length(); i++) {
			if(sequence.charAt(i) == 'R') {
				if(beforeChar == 'L') {
					
					resultBuilder.append(makeSubStr(rCount, lCount, childCntArr, rIndex, lIndex).toString());
					rCount = 1;
					lCount = 0;
					childCntArr[0] = 1;
					childCntArr[1] = 0;
					childCnt = 1;
					
				}else {
					
					rCount++;
					childCntArr[childCnt % 2]++;
					childCnt++;
					
				}
				beforeChar = 'R';
			}else if(sequence.charAt(i) == 'L') {
				if(beforeChar == 'R') {
					
					rIndex = (childCnt + 1) % 2;
					lIndex = childCnt % 2;
					childCntArr[childCnt % 2]++;
					childCnt++;
					lCount++;
					
				}else {
					
					childCntArr[childCnt % 2]++;
					childCnt++;
					lCount++;
					
				}
				beforeChar = 'L';
			}
		}
		
		resultBuilder.append(makeSubStr(rCount, lCount, childCntArr, rIndex, lIndex).toString());
		System.out.println(resultBuilder.substring(0, resultBuilder.length() - 1));
  	}
	
	public StringBuilder makeSubStr(int rCount, int lCount, int[] childCntArr, int rIndex, int lIndex) {
		
		StringBuilder retBuilder = new StringBuilder();
		for(int i = 0; i < rCount - 1; i++) {
			retBuilder.append("0 ");
		}
		retBuilder.append(childCntArr[rIndex]+" ");
		retBuilder.append(childCntArr[lIndex]+" ");
		for(int i = 0; i < lCount - 1; i++) {
			retBuilder.append("0 ");
		}
		
		//System.out.println(retBuilder.toString());
		return retBuilder;
		
	}
}
