Bean Harvest
After a long day of harvesting legumes, Petya decided to have some fun. He took N cups, arranged them in a circle, and placed a certain number of peas in each cup. During each turn, he takes all the peas from one cup and distributes them one by one into the subsequent cups in the circle. On the first turn, he starts by taking peas from the first cup. For each following turn, he begins with the cup where he placed the last pea in the previous turn. Your task is to determine how many peas will be in each cup after T turns.
Input
The first line of the input specifies the number of cups N (1 ≤ N ≤ 10^4). The second line contains N integers a_i, representing the initial number of peas in each cup (0 ≤ a_i ≤ 10^9, with a_1 = 0). The third line provides the number of turns T (0 ≤ T ≤ 10^4).
Output
Output a single line with N integers, indicating the number of peas in each cup after T turns.