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 java.io.*;
import java.nio.charset.StandardCharsets;

public class Main {

	public static void main(String[] args) throws IOException {
		InputStreamReader reader = new InputStreamReader(System.in, StandardCharsets.UTF_8);
		BufferedReader in = new BufferedReader(reader);

		String S = in.readLine();
		List<String> splited = split(S);
		List<Integer> result = new ArrayList<>(S.length());
		for (int i = 0; i < splited.size(); ++i) {
			result.addAll(convert(splited.get(i)));
		}
		StringBuilder strBuilder = new StringBuilder();
		strBuilder.append(Integer.toString(result.get(0)));
		for (int i = 1; i < result.size(); ++i) {
			strBuilder.append(" " + Integer.toString(result.get(i)));
		}
		System.out.println(strBuilder.toString());
	}

	static List<Integer> convert(String s) {
		int lCount = 0, rCount = 0;
		// 分割位置を求める
		int splitPos = 0;
		for (int i = 0; i + 1 < s.length(); ++i) {
			if (s.charAt(i) != s.charAt(i + 1)) {
				splitPos = i;
				break;
			}
		}
		int lNum = splitPos + 1;
		int rNum = s.length() - lNum;

		if (lNum % 2 == 0) {
			lCount += lNum / 2;
			rCount += lNum / 2;
		} else {
			lCount += lNum / 2 + 1;
			rCount += lNum - lCount;
		}
		if (rNum % 2 == 0) {
			lCount += rNum / 2;
			rCount += rNum / 2;
		} else {
			lCount += rNum / 2;
			rCount += rNum / 2 + 1;
		}
		List<Integer> result = new ArrayList<>(s.length());
		for (int i = 0; i < splitPos; ++i) {
			result.add(0);
		}
		result.add(lCount);
		result.add(rCount);
		for (int i = splitPos + 2; i < s.length(); ++i) {
			result.add(0);
		}

		return result;
	}

	static List<String> split(String S) {
		Deque<StringBuilder> queue = new ArrayDeque<>();
		queue.addLast(new StringBuilder());
		queue.getLast().append(S.charAt(0));
		char last = S.charAt(0);

		for (int i = 1; i < S.length(); ++i) {
			char c = S.charAt(i);
			if (c == 'R') {
				if (last == c) {
					queue.getLast().append(S.charAt(i));
				} else {
					queue.addLast(new StringBuilder());
					queue.getLast().append(S.charAt(i));
				}
			} else {
				if (last == c) {
					queue.getLast().append(S.charAt(i));
				} else {
					queue.getLast().append(S.charAt(i));
				}
			}
			last = c;
		}
		List<String> r = new ArrayList<>(queue.size());
		while (!queue.isEmpty()) {
			r.add(queue.poll().toString());
		}
		return r;
	}
}