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

class Main {
	public static void main(String[] args) {
		new Main().run();
	}

	void run() {
		Scanner sc = new Scanner(System.in);
		char[] cs = sc.next().toCharArray();
		int[] r = new int[cs.length];
		int[] l = new int[cs.length];
		for (int i = 0; i < cs.length; ++i) {
			if (cs[i] == 'L') {
				l[i] = l[i - 1] + 1;
			}
		}
		for (int i = cs.length - 1; i >= 0; --i) {
			if (cs[i] == 'R') {
				r[i] = r[i + 1] + 1;
			}
		}
		PrintWriter pw = new PrintWriter(System.out);
		int[] cnt = new int[cs.length];
		for (int i = 0; i < cs.length; ++i) {
			if (cs[i] == 'R') {
				++cnt[i + r[i] - r[i] % 2];
			} else {
				++cnt[i - l[i] + l[i] % 2];
			}
		}
		for (int i = 0; i < cs.length; ++i) {
			pw.print(cnt[i] + (i == cs.length - 1 ? "\n" : " "));
		}
		pw.close();
	}

	void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}

}