A rotating status beacon holds an array of n integer readings. A right-rotation by one position moves every reading one slot to the right, and the last reading wraps around to the front. Perform a right-rotation by exactly k positions and report the resulting array.
Formally, after the rotation the reading originally at index i (0-indexed) ends up at index (i + k) mod n.
Input format
Line 1: two integers n and k.
Line 2: n space-separated integers, the readings in order.
Output format
n space-separated integers on one line: the array after rotating right by k.
Constraints
- 1 ≤ n ≤ 100000
- 0 ≤ k ≤ 1000000000
- -1000000000 ≤ each reading ≤ 1000000000