Dịch đoạn [l, r] sang phải một bước (Right-Shift a Subarray [l, r] by One)

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem

Given an integer array $a_0,a_1,\ldots,a_{n-1}$ and indices $l,r$ satisfying

Within the segment $[l,r]$ only, perform one cyclic right shift. Every position outside the segment remains unchanged.

Let the result be $b$. If $l=r$, then $b=a$. If $l<r$, then

and

Print $b$.

Input

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

Output

Print the array after cyclically shifting segment $[l,r]$ one position to the right.

Subtask

Subtask 1 (100 points): $1\le n\le2\cdot10^5$; $0\le l\le r<n$; $|a_i|\le10^9$.

Example

Input

7 1 4
10 20 30 40 50 60 70

Output

10 50 20 30 40 60 70

Explanation

The segment 20 30 40 50 becomes 50 20 30 40; the elements 10 60 70 are outside the segment and remain unchanged.