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

public class Main {

    private static int MOD = 1_000_000_007;

    public static void main(String[] args) {
        final Scanner scanner = new Scanner(System.in);
        solve(scanner);
    }


    // int N = Integer.parseInt(scanner.nextLine());
    // int N = scanner.nextInt(), M = scanner.nextInt();
    // scanner.nextLine();
    // int[] n = Arrays.stream(scanner.nextLine().split(" ")).mapToInt(Integer::parseInt).toArray();
    static void solve(Scanner scanner) {
        String S = scanner.nextLine();
        int[] right = new int[S.length()], left = new int[S.length()];
        right[0] = 0;
        for (int i = 1; i < S.length(); i++) {
            if (S.charAt(i) == 'R') {
                right[i] = i;
            } else {
                right[i] = right[i - 1];
            }
        }
        left[S.length() - 1] = S.length() - 1;
        for (int i = S.length() - 2; i >= 0; i--) {
            if (S.charAt(i) == 'L') {
                left[i] = i;
            } else {
                left[i] = left[i + 1];
            }
        }

        int ans[] = new int[S.length()];
        for (int i = 0; i < S.length(); i++) {
            if (S.charAt(i) == 'R') {
                int diff = left[i] - i;
                if (diff % 2 == 0) {
                    ans[left[i]]++;
                } else {
                    ans[left[i] - 1]++;
                }
            } else {
                int diff = i - right[i];
                if (diff % 2 == 0) {
                    ans[right[i]]++;
                } else {
                    ans[right[i] + 1]++;
                }
            }
        }

        StringBuilder sb = new StringBuilder();
        for (int n: ans) {
            sb.append(n);
            sb.append(' ');
        }

        System.out.println(sb.toString().trim());
    }

}
