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.next();

      s = s + 'R';

      int lng =s.length();

      char r = 'R';
      char l = 'L';

      char[] c = new char[lng];
      for(int i=0;i<lng;i++){
        c[i] = s.charAt(i);
      }

      int[] num = new int[lng];
      for(int i=0;i<lng;i++){
        num[i] = 0;
      }

      int cnt=0;
      int numR;
      int numL;
      int flag=0;

      for(int i=0;i<lng-1;i++){
        cnt++;
        if(c[i]==l && c[i+1]==r){//if LR finds
        //////////////////////////////////////////////////////
          for(int j=flag;j<=i;j++){//find RL
            if(c[j]==r && c[j+1]==l){//if RL finds
              numL = i-j-1;
              numR = cnt - numL - 2;
              num[j] = calcL(cnt,numR,numL);
              num[j+1] = calcR(cnt,numR,numL);
              flag = i+1;
              cnt=0;
              break;
            }
          }
        /////////////////////////////////////////////////////
        }
      }

////////////////////////////////////////////////
      for(int i=0;i<lng-1;i++){
        System.out.print(num[i]+" ");
      }
////////////////////////////////////////////////
    }

    public static int calcL(int cn,int rr,int ll){
      int ans=0;
      if(cn%2==0){
        ans = cn/2;
      }
      else if(rr%2==0){
        ans = (cn+1)/2;
      }
      else if(rr%2==1){
        ans = (cn-1)/2;
      }
      return ans;
    }
    public static int calcR(int cn,int rr,int ll){
      int ans=0;
      if(cn%2==0){
        ans = cn/2;
      }
      else if(rr%2==0){
        ans = (cn-1)/2;
      }
      else if(rr%2==1){
        ans = (cn+1)/2;
      }
      return ans;
    }

}
