A conveyor belt carries n items, numbered by position 1..n, each holding a given item ID. The belt is rotated left by k steps: this is equivalent to removing the first k items from the front (in order) and appending them, still in order, to the back. k may be larger than n (in which case only k mod n steps actually change anything). Print the resulting sequence of item IDs after the rotation.
Input format
Line 1: two integers n k.
Line 2: n space-separated integers, the item IDs.
Output format
n space-separated integers: the item IDs after rotating left by k (equivalently k mod n) positions.
Constraints
- 1 <= n <= 100000
- 0 <= k <= 1000000000
- -1000000000 <= item ID <= 1000000000