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.Scanner;

public class Main{
  public static int[] correctGoal;
  public static int[] wrongGoal;
  
  public static void goal(String s, int start){
    if(s.charAt(start) == 'L'){
      correctGoal[start] = wrongGoal[start - 1];
      wrongGoal[start] = correctGoal[start - 1];
    }else if(start > 0 && s.charAt(start - 1) == 'R'){
      correctGoal[start] = wrongGoal[start - 1];
      wrongGoal[start] = correctGoal[start - 1];
    }else{
      int step = 0;
      while(s.charAt(start + step) == 'R'){
        step++;
      }
      if(step % 2 == 0){
        correctGoal[start] = start + step;
        wrongGoal[start] = start + step - 1;
      }else{
        correctGoal[start] = start + step - 1;
        wrongGoal[start] = start + step;
      }
    }
  }
  
  public static void main(String[] args){
    Scanner scanner = new Scanner(System.in);
    String s = scanner.nextLine();
    int n = s.length();
    correctGoal = new int[n];
    wrongGoal = new int[n];
    int[] gathered = new int[n];
    for(int i = 0; i < n; i++){
      gathered[i] = 0;
      goal(s, i);
    }
    for(int i = 0; i < n; i++){
      gathered[correctGoal[i]]++;
    }
    for(int i = 0; i < n - 1; i++){
      System.out.print(gathered[i] + " ");
    }
    System.out.println(gathered[n-1]);  
  }
}
