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;
import java.util.stream.Collectors;

public class Main {

    private static Scanner in = new Scanner(System.in);
    private static PrintWriter out = new PrintWriter(System.out);

    private static final long MOD = (long) 1e9 + 7;

    public static void main(String[] args) {
        solve();
        out.flush();
    }

    private static void solve() {
        String s = in.next();

        boolean toRight = true;
        int l = 0;
        int mid = 0;
        int r = 0;
        int[] ans = new int[s.length()];
        char[] ch = s.toCharArray();
        for (int i=0; i < s.length(); i++) {
            if (toRight && ch[i] == 'L') {
                mid = i - 1;
                toRight = false;
            } else if (!toRight && ch[i] == 'R') {
                r = i - 1;
                toRight = true;
                ans[mid] += (r - mid) / 2 + 1;
                ans[mid+1] += (r - mid + 1) / 2;

                ans[mid] += (mid - l) / 2;
                ans[mid+1] += (mid - l + 1) / 2;

                l = i;
            }
        }

        r = s.length() - 1;
        ans[mid] += (r - mid) / 2 + 1;
        ans[mid+1] += (r - mid + 1) / 2;

        ans[mid] += (mid - l) / 2;
        ans[mid+1] += (mid - l + 1) / 2;

        StringBuilder a = new StringBuilder();
        for (int i=0; i < s.length() - 1; i++) {
            a.append(ans[i]).append(" ");
        }
        a.append(ans[s.length()-1]);
        out.println(a);
    }

}
