Robots#10445
Kozak Vus has bought an intriguing game. It features a strip with cells, numbered sequentially from to , each containing exactly one robot. Each cell is marked with either the letter 'L' or 'R'.
Every second, robots in cells marked with 'L' move one cell to the left, while those in cells marked with 'R' move one cell to the right. If a robot moves outside the strip, it becomes inactive and no longer participates in the game.
Kozak Vus intends to play this game for exactly seconds. He wants to know how many robots will occupy each cell after seconds.
The first line contains a single integer (1 \leq n \leq 10^6) — the number of cells in the game that Kozak Vus purchased.
The second line contains characters, each either 'L' or 'R'. The -th character represents the symbol in cell number .
The third line contains a single integer (1 \leq t \leq 10^{18}) — the duration of the game in seconds.
Output numbers, where the -th number indicates the number of robots in cell number after seconds.
Example 1
Example 2
In the first example, after one second, the result will be [1, 2, 0]: the robot from the first cell moves to the second, the robot from the second moves to the first, and the robot from the third moves to the second. After another second, the result will be [2, 1, 0]: the robot from the first cell moves to the second, and two robots from the second cell move to the first.
( points) 1 \leq n, t \leq 10^3;
( points) 1 \leq n \leq 10^3;
( points) No additional constraints.