{"raw_statement":[{"iden":"problem statement","content":"Given is a string $S$ consisting of `L` and `R`.\nLet $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.\nThe character written on the leftmost square is always `R`, and the character written on the rightmost square is always `L`.\nInitially, one child is standing on each square.\nEach child will perform the move below $10^{100}$ times:\n\n*   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.\n\nFind the number of children standing on each square after the children performed the moves."},{"iden":"constraints","content":"*   $S$ is a string of length between $2$ and $10^5$ (inclusive).\n*   Each character of $S$ is `L` or `R`.\n*   The first and last characters of $S$ are `R` and `L`, respectively."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$"},{"iden":"sample input 1","content":"RRLRL"},{"iden":"sample output 1","content":"0 1 2 1 1\n\n*   After each child performed one move, the number of children standing on each square is $0, 2, 1, 1, 1$ from left to right.\n*   After each child performed two moves, the number of children standing on each square is $0, 1, 2, 1, 1$ from left to right.\n*   After each child performed $10^{100}$ moves, the number of children standing on each square is $0, 1, 2, 1, 1$ from left to right."},{"iden":"sample input 2","content":"RRLLLLRLRRLL"},{"iden":"sample output 2","content":"0 3 3 0 0 0 1 1 0 2 2 0"},{"iden":"sample input 3","content":"RRRLLRLLRRRLLLLL"},{"iden":"sample output 3","content":"0 0 3 2 0 2 1 0 0 0 4 4 0 0 0 0"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}