The Great Bean Gathering#5965
The problem involves a game with peas and bowls. There are N = 2^k + 1 bowls arranged in a circle, each initially containing one pea. During each turn, Petya picks up all the peas from a specific bowl and distributes them one by one into the subsequent bowls in a clockwise direction. On the first turn, Petya starts with the first bowl. For each following turn, Petya begins with the bowl where the last pea was placed in the previous turn.
Your task is to determine the number of peas in the bowls numbered from to , inclusive, after turns.
The input consists of a single line containing four integers: , , , and .
Constraints are as follows: 1 \le k \le 63, 0 \le T < 10^{200}, 1 \le a \le b \le 2^k + 1.
Output a single line containing b-a+1 numbers, representing the number of peas in each of the bowls numbered from to after turns.
Example 1