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
// D - Gathering Children
#include <bits/stdc++.h>
using namespace std;
#define rp(i,s,e) for(int i=(s);i<(e);++i)

void out(int s, int l, int e, int o){
	rp(i, s, l-1) cout<<"0 ";
	cout<< (l%2? e:o) <<" "<< (l%2? o:e) <<" ";
}

int main(){
	string S; cin>>S;
	int s = 0, l = -1, r = -1, e, o, n = S.size();
	rp(i, 0, n){
		if(r<0 && S[i]=='R'){
			if(l>=0) out(s,l,e,o);
			s = l + 1;
			r = i; l = -1;
			e = o = 0;
		}
		else if(l<0 && S[i]=='L'){
			l = i; r = -1;
		}
		if(i%2) o++; else e++;
	}
	out(s,l,e,o);
	rp(i, l+1, n) cout<<"0 ";
}