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.InputStream;
import java.io.PrintStream;
import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    resolve(System.in, System.out);
  }

  static void resolve(InputStream is, PrintStream pw) {
    Scanner sc = new Scanner(is);
    String s = sc.next();
    int[] position = new int[s.length()];
    int blockLength = 0;
    for (int i = 0; i < s.length() - 1; i++) {
      String current = Character.toString(s.charAt(i));
      String next = Character.toString(s.charAt(i + 1));
      blockLength++;
      if (current.equals(next)) {
        continue;
      } else {
        position[i] += blockLength / 2;
        position[i + 1] += blockLength / 2;
        if (blockLength % 2 != 0) {
          position[i] += 1;
        }
        blockLength = 0;
        int nextBlockLength = 0;
        for (int j = i + 1; j < s.length(); j++) {
          if (j == s.length() - 1) {
            nextBlockLength++;
          }
          if (next.equals(Character.toString(s.charAt(j))) && j != s.length() - 1) {
            nextBlockLength++;
            continue;
          } else {
            position[i] += nextBlockLength / 2;
            position[i + 1] += nextBlockLength / 2;
            if (nextBlockLength % 2 != 0) {
              position[i + 1] += 1;
            }
            i = j - 1;
            break;
          }
        }
      }
    }
    boolean isFirst = true;
    for (int i = 0; i < s.length(); i++) {
      if (!isFirst) {
        pw.print(" ");
      }
      pw.print(position[i]);
      isFirst = false;
    }
  }
}
