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

public class Main {
    public static void main(String[] args) {
        final Scanner scanner = new Scanner(System.in);
        final char[] chars = scanner.nextLine().toCharArray();
        final int[] answer = new int[chars.length];

        final List<Integer> rIndexes = new ArrayList<>();
        final List<Integer> lIndexes = new ArrayList<>();

        for (int i = 0; i < chars.length; i++) {
            if (chars[i] == 'R') {
                rIndexes.add(i);
            } else {
                lIndexes.add(i);
            }
        }

        for (int i = 0; i < chars.length; i++) {
            if (chars[i] == 'R') {
                final int lIndex = findLIndex(i, lIndexes);
                if ((lIndex - i) % 2 == 0) {
                    answer[lIndex]++;
                } else {
                    answer[lIndex - 1]++;
                }
            } else {
                final int rIndex = findRIndex(i, rIndexes);
                if ((i - rIndex) % 2 == 0) {
                    answer[rIndex]++;
                } else {
                    answer[rIndex + 1]++;
                }
            }
        }

        for (final int i : answer) {
            System.out.print(i + " ");
        }

    }

    private static int findRIndex(final int index, final List<Integer> rIndexes) {
        final int i = -(Collections.binarySearch(rIndexes, index) + 2);
        return rIndexes.get(i);
    }

    private static int findLIndex(final int index, final List<Integer> lIndexes) {
        final int i = -(Collections.binarySearch(lIndexes, index) + 1);
        return lIndexes.get(i);
    }
}
