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

public class Main {
    public static void main(String[] args) {
        FastScanner scanner = new FastScanner();
        PrintWriter out = new PrintWriter(System.out);
        char[] s = scanner.next().toCharArray();
        int p1 = 0;
        int p2 = 0;
        int N = s.length;
        int[] end = new int[N];
        while(p1 < N || p2 < N) {
            while(p2 < N && s[p2] == s[p1]) p2++;
            if (s[p1]=='R') while(p1 != p2) end[p1++] = p2-1;
            else {
                for(int i = p1; i < p2; i++) end[i] = p1;
                p1 = p2;
            }
        }
        int[] ans = new int[N];
        for(int i =0; i < N; i++) {
            int dist = Math.abs(end[i] - i);
            if (dist % 2 == 0 && s[i] == 'R') ans[end[i]]++;
            if (dist % 2 == 1 && s[i] == 'R') ans[end[i]+1]++;
            if (dist % 2 == 0 && s[i] == 'L') ans[end[i]]++;
            if (dist % 2 == 1 && s[i] == 'L') ans[end[i]-1]++;
        }
        for(int i = 0; i < N; i++) {
            if (i > 0) out.print(" " );
            out.print(ans[i]);
        }
        out.println();
        out.flush();
    }
    
    public static class FastScanner {
        BufferedReader br;
        StringTokenizer st;
        
        public FastScanner(Reader in) {
            br = new BufferedReader(in);
        }
        
        public FastScanner() {
            this(new InputStreamReader(System.in));
        }
        
        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
        
        int nextInt() {
            return Integer.parseInt(next());
        }
        
        long nextLong() {
            return Long.parseLong(next());
        }
        
        double nextDouble() {
            return Double.parseDouble(next());
        }
        
        String readNextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}
