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.io.PrintStream;
import java.util.Arrays;
import java.util.Scanner;

public class Main {
	static final PrintStream out = System.out;
	static Scanner sc = new Scanner(System.in);
	static final long Mod = 1000_000_007L;
	public static void main(String[] args) {
		Main main = new Main();
		main.solve();
		System.exit(0);
	}

	void solve() {
		String S = next();
		int N = S.length();
		char[] C = S.toCharArray();
		int[] child = new int [N];
		Arrays.fill(child,1);

		for(int i=0;i<N;i++) {
			int ti = i;
			if(C[i]=='R')ti++;
			else if(C[i]=='L')ti--;

			if(C[ti]=='R')ti++;
			else if(C[ti]=='L')ti--;

			int tmp = child[i];
			child[i] = 0;
			child[ti] += tmp;

		}
		for(int i=N-1;0<=i;i--) {
			int ti = i;
			if(C[i]=='R')ti++;
			else if(C[i]=='L')ti--;

			if(C[ti]=='R')ti++;
			else if(C[ti]=='L')ti--;

			int tmp = child[i];
			child[i] = 0;
			child[ti] += tmp;


		}

		StringBuilder buf = new StringBuilder();
		for(int i=0;i<N;i++) {
			if(i<N-1) {
				buf.append(child[i]+" ");
			}else if(i==N-1){
				buf.append(child[i]);
			}
		}
		out.println(buf);
	}


	public int[] nextIntArray(int n) {
		int[] a = new int[n];
		for (int i = 0; i < n; i++)a[i] = nextInt();
		return a;
	}
	public long[] nextLongArray(int n) {
		long[] a = new long[n];
		for (int i = 0; i < n; i++)a[i] = nextLong();
		return a;
	}
	public int nextInt() {
		return Integer.parseInt(next());
	}
	public long nextLong() {
		return Long.parseLong(next());
	}
	public String next() {
		return sc.next();
	}


}