Dịch vòng trái (Left Rotation)

Source: HackerRank

Version: Phuoc Hung OJ Extended

Problem

Given an integer array $a_0,a_1,\ldots,a_{n-1}$ and a non-negative integer $d$.

One left rotation by one position transforms

into

Perform $d$ left rotations. Define

Then the result $b$ satisfies

Print $b$.

Input

The first line contains integers $n$ and $d$. The second line contains $n$ integers $a_0,a_1,\ldots,a_{n-1}$.

Output

Print the array after $d$ left rotations on one line.

Subtask

Subtask 1 (100 points): $1\le n\le 2\cdot10^5$; $0\le d\le10^{18}$; $|a_i|\le10^9$.

Example

Input

5 4
1 2 3 4 5

Output

5 1 2 3 4

Explanation

Here $s=4\bmod5=4$. Thus $b_0=a_4=5$, followed by $a_0,a_1,a_2,a_3$.