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.*;
 
public class Main{
  public static void main(String[]args){
    Scanner sc =  new Scanner(System.in);
    String S = sc.nextLine();
    int N = S.length();
    int[] num = new int[N];
    int r = 0, l = 0, ir = 0, il = 0;
    for(int i = 0; i < N; i++){
      if(S.charAt(i) == 'R'){
        r++;
      }else{
        l++;
      }
      
      if(S.charAt(i) == 'R' && S.charAt(i+1) == 'L'){
        ir = i;
        il = i+1;
      }
      
      if(S.charAt(i) == 'L'){
        if(i == N-1){
          num[ir] = num[il] = (r+l)/2;
          if((r+l)%2 == 1){
            if((r > l && l%2 == 1) || (r < l && r%2 == 0)){
              num[il]++;
            }else{
              num[ir]++;
            }
          }
          l = r = 0;
        }else if(S.charAt(i+1) == 'R'){
          num[ir] = num[il] = (r+l)/2;
          if((r+l)%2 == 1){
            if((r > l && l%2 == 1) || (r < l && r%2 == 0)){
              num[il]++;
            }else{
              num[ir]++;
            }
          }
          l = r = 0;
        }
      }
    }
    
    for(int j = 0; j < N; j++){
      if(j < N-1){
        System.out.print(num[j]);
        System.out.print(" ");
      }else{
        System.out.println(num[j]);
      }
    }
  }
}