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();
        sc.close();
        char[] c = S.toCharArray();
        int N = S.length();
        int idx = 0;
        int[] num = new int[N];
        while(idx < N){
            if(idx < N && c[idx] == 'R'){
                int cnt = 0;
                while(c[idx] == 'R'){
                    idx++;
                    cnt++;
                }
                num[idx] += (cnt)/2;
                num[idx-1] += (cnt+1)/2;
            }
            if(c[idx] == 'L'){
                int count = 0;
                int start = idx;
                while(idx < N &&c[idx] == 'L'){
                    idx++;
                    count++;
                }
                num[start] += (count+1)/2;
                num[start-1] += (count)/2;
            }
        }

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