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.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.util.*;
import java.util.stream.Stream;

public class Main {
    private static char[] map;
    public static void main(String[] args) throws Exception {
        Main main = new Main();
        main.solve();
    }
    public void solve() throws Exception {
        Scanner scan = new Scanner(new BufferedReader(new InputStreamReader(System.in)));
        String S = scan.next();
        int length = S.length();
        char[] data = S.toCharArray();
        int[][] right = new int[length][3];
        for (int i = 0; i < length; i++) {
            Arrays.fill(right[i],Integer.MAX_VALUE);
        }
        for (int i = length-1; 0<=i; i--) {
            if (data[i]=='L') {
                right[i][0] = 0;
                right[i][1] = i;
                right[i][2] = -1;
                continue;
            }
            right[i][0] = right[i+1][0] + 1;
            right[i][1] = right[i+1][1];
            right[i][2] = right[i+1][2];
        }
        int[][] left = new int[length][3];
        for (int i = 0; i < length; i++) {
            Arrays.fill(left[i],Integer.MAX_VALUE);
        }
        for (int i = 0; i < length; i++) {
            if (data[i]=='R') {
                left[i][0] = 0;
                left[i][1] = i;
                left[i][2] = 1;
                continue;
            }
            left[i][0] = left[i-1][0] + 1;
            left[i][1] = left[i-1][1];
            left[i][2] = left[i-1][2];
        }
        int[] answer = new int[length];
        BigInteger total = BigInteger.TEN.pow(100);
        BigInteger two = new BigInteger("2");
        for (int i = 0; i < length; i++) {
            if (right[i][0] < left[i][0]) {
                BigInteger remain = total.subtract(new BigInteger(Long.toString(left[i][0])));
                if (remain.mod(two).longValue() == 0) {
                    answer[left[i][1]] += 1;
                } else {
                    answer[left[i][1] + left[i][2]] += 1;
                }
            } else {
                BigInteger remain = total.subtract(new BigInteger(Long.toString(right[i][0])));
                if (remain.mod(two).longValue() == 0) {
                    answer[right[i][1]] += 1;
                } else {
                    answer[right[i][1] + right[i][2]] += 1;
                }
            }
        }
        StringBuilder sb = new StringBuilder();
        for (long i : answer) {
            sb.append(i);
            sb.append(" ");
        }
        System.out.println(sb.substring(0, sb.length()-1));
    }
}
