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.*;
//import static java.lang.Integer.*;
//import static java.lang.Long.*;
//import static java.lang.Math.*;
import static java.lang.System.*;

import java.io.PrintWriter;
import java.math.BigInteger;

public class Main {
	static long cnt=0;
	static BigInteger bi13 =new BigInteger("13");
	static BigInteger bi5 =new BigInteger("5");

	public static void main(String[] args) {
		int i,j;
		Scanner sc = new Scanner(in);
		String s = sc.next();
		sc.close();
		int a[] = new int[s.length()];
		boolean prer = true;
		int rcnt = 1;
		int lcnt = 0;
		int p1=0;
		int p2=0;
		int aa;
		for (i = 1; i < s.length(); i++) {
			if(prer) {
				if(s.charAt(i) == 'R') {
					rcnt++;
				} else {
					prer=false;
					lcnt++;
					p1 = i-1;
					p2 = i;
				}
			} else {
				if(s.charAt(i) == 'R') {
					prer=true;
					aa = rcnt + lcnt;
					a[p1] = aa/2;
					a[p2] = aa/2;
					if(aa % 2 ==1) {
						if(rcnt % 2 ==1) {
							a[p1]++;
						} else {
							a[p2]++;
						}
					}
					rcnt=1;
					lcnt=0;
				} else {
					lcnt++;
				}
			}
		}
		aa = rcnt + lcnt;
		a[p1] = aa/2;
		a[p2] = aa/2;
		if(aa % 2 ==1) {
			if(rcnt % 2 ==1) {
				a[p1]++;
			} else {
				a[p2]++;
			}
		}
		PrintWriter out = new PrintWriter(System.out);
		for(i = 0; i < s.length(); i++) {
			out.print(a[i]);
			out.print(" ");
		}
		out.flush();
	}
}
