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
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main()
{
	string s;cin>>s;
	vector<int> lr;
	for(int i=1;i<s.size()+1;++i)
	{
		int l=1;
		while(s[i]==s[i-1])
		{
			l++;
			i++;
		}
		lr.push_back(l);
		//if(l!=1)i--;
	}
 
	for(int i=0;i<lr.size();i+=2)
	{
		for(int j=0;j<lr[i]-1;++j)cout<<0<<" ";
		int num=lr[i]/2+lr[i+1]/2;
		cout<<num+lr[i]%2<<" ";
		cout<<num+lr[i+1]%2<<" ";
		for(int j=0;j<lr[i+1]-1;++j)cout<<0<<" ";
	}
	cout<<endl;
/*
	for(int i=0;i<lr.size();++i)
	{
		cout<<lr[i]<<endl;
	}
	*/
	return 0;
}