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

public class Main {

    class Sep {
        int rCount, lCount, rlStartIdx;
        public Sep(int rCount, int lCount, int rlStartIdx) {
            this.rCount = rCount;
            this.lCount = lCount;
            this.rlStartIdx = rlStartIdx;
        }

        int lValue() {
            if (this.rCount == this.lCount) {
                return this.rCount;
            } else if (this.rCount % 2 == 0) {
                return (this.rCount + this.lCount) / 2;
            } else {
                return (this.rCount + this.lCount) / 2 + (this.rCount + this.lCount) % 2;
            }
        }

        int rValue() {
            if (this.rCount == this.lCount) {
                return this.rCount;
            } else if (this.rCount % 2 == 0) {
                return (this.rCount + this.lCount) / 2 + (this.rCount + this.lCount) % 2;
            } else {
                return (this.rCount + this.lCount) / 2 ;
            }
        }
    }

    void run() {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        List<Sep> sepList = new ArrayList<>();

        int rlStartIdx = 0;
        int rCount = 0;
        int lCount = 0;
        for (int i = 0 ; i < s.length(); i++) {
            if (s.charAt(i) == 'R') {
                rCount++;
                if (s.charAt(i + 1) == 'L') {
                    rlStartIdx = i;
                }
            } else {
                lCount++;
                if (i == s.length() - 1 || s.charAt(i + 1) == 'R') {
                    sepList.add(new Sep(rCount, lCount, rlStartIdx));
                    rlStartIdx = 0;
                    rCount = 0;
                    lCount = 0;
                }
            }
        }

        int[] ans = new int[s.length()];

        for (Sep sep : sepList) {
            ans[sep.rlStartIdx] = sep.lValue();
            ans[sep.rlStartIdx + 1] = sep.rValue();
        }

        for (int i = 0 ; i < s.length() - 1; i++) {
            System.out.print(ans[i]);
            System.out.print(" ");
        }
        System.out.println(ans[s.length() - 1]);

    }

    void debug(Object... os) {
        System.err.println(Arrays.deepToString(os));
    }

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