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.*;
import java.io.*;
import java.lang.*;
import java.math.*;
public class Main {
    public static void main(String[] args) throws Exception {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
        String s = bf.readLine();
        int n = s.length();
        ArrayList<Integer> pos = new ArrayList<Integer>();
        for(int i=0; i<n-1; i++) {
          if(s.charAt(i)=='R' && s.charAt(i+1)=='L') pos.add(i);
        }
        int[] ans = new int[n];
        for(int i : pos) {
          int cur = i;
          int count = 0;
          while((cur >=0) && (s.charAt(cur) == 'R')) {
            count++;
            if(count%2 == 1) ans[i] ++;
            else ans[i+1]++;

            cur--;

          }
          cur = i+1;
          count = 0;
          while((cur < n) && (s.charAt(cur) == 'L')) {
            count++;
            if(count%2 == 1) ans[i+1] ++;
            else ans[i]++;

            cur++;

          }

        }
        StringBuilder sb = new StringBuilder();
        for(int i : ans) sb.append(i+" ");
        out.println(sb.toString());
        // int n = Integer.parseInt(bf.readLine());
        // StringTokenizer st = new StringTokenizer(bf.readLine());
        // int[] a = new int[n]; for(int i=0; i<n; i++) a[i] = Integer.parseInt(st.nextToken());
        // int n = Integer.parseInt(st.nextToken());

        out.close(); System.exit(0);
    }
}
