Cyclic shift

Cyclically shift an array of $n$ numbers by $k$ steps to the right: on each step the last element moves to the front and the others move one position right. For example, 1 2 3 becomes 3 1 2 after one step.

The first line contains $n$ and $k$ ($1 \le n \le 10^5$, $0 \le k \le 10^9$). The second line contains $n$ integers ($|a_i| \le 10^9$).

A single line with $n$ numbers — the shifted array.

Shifting by $n$ steps brings the array back, so $k \bmod n$ is enough instead of $k$ — doing $10^9$ steps one by one would take too long. Element $i$ goes to position $(i + k) \bmod n$ in the new array. In the second example $7 \bmod 3 = 1$: 3 1 2.