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.*;

public class Main {

    long INF = Long.MAX_VALUE;
    long[] dp;
    long n;
    long S;

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

    void solve() {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        char[] S = s.toCharArray();
        int[] ans = new int[s.length()];
        int c = 0;
        int c1 = 1;
        for (int i = 0; i < s.length(); i++) {
            if (i > 0) {
                if (S[i] == S[i - 1]) {
                    c1++;
                } else {
                    c = Math.max(c, c1);
                    c1 = 1;
                }
            }
        }
        int rc = 0;
        for (int i = 0; i < s.length(); i++) {
            if (i == s.length() - 1) {
                if (S[i] == 'R') {
                    ans[i] += rc;
                }
                continue;
            }
            if (S[i] == 'R') {
                if (S[i + 1] == S[i]) {
                    rc++;
                } else {
                    rc++;
                    ans[i] += rc / 2 + rc % 2;
                    ans[i + 1] += rc / 2;
                    rc = 0;
                }
            }
        }
        int lc = 0;
        for (int i = s.length() - 1; i >= 0; i--) {
            if (i == 0) {
                if (S[i] == 'L') {
                    ans[i] += lc;
                }
                continue;
            }
            if (S[i] == 'L') {
                if (S[i - 1] == S[i]) {
                    lc++;
                } else {
                    lc++;
                    ans[i] += lc / 2 + lc % 2;
                    ans[i - 1] += lc / 2;
                    lc = 0;
                }
            }
        }
        for (int i = 0; i < s.length(); i++) {
            System.out.print(ans[i] + " ");
        }
        System.out.println();

    }

    int gcd(int m, int n
    ) {
        if (m < n) {
            return gcd(n, m);
        }
        if (n == 0) {
            return m;
        }
        return gcd(n, m % n);
    }
}