Simulate a queue#11786
Given a sequence A = (a_1, a_2, \ldots, a_n) of integers of length .
Perform the following operation exactly times:
Compute as the sum of the first and last elements of .
Remove the first element of and append to the end of .
After applying these operations, print all elements of .
The first line contains two integers (n \le 10^5) and (k \le 10^5).
The second line contains integers representing the initial sequence .
Print all elements of after performing the operations.
Example 1
Example 2