Print the Last k Elements

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem Statement

You are given an integer array $a$ of length $n$, indexed from $0$ to $n-1$, and an integer $k$ satisfying $1 \le k \le n$. Print exactly the last $k$ elements. The first required index is $n-k$ and the last is $n-1$.

Input

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

Output

Print $a_{n-k},a_{n-k+1},\ldots,a_{n-1}$ on one line, separated by spaces.

Subtasks

Subtask 1 (20 points): $1 \le n \le 10$, $k=1$, $-9 \le a_i \le 9$.

Subtask 2 (30 points): $2 \le n \le 20$, $k=n$, $0 \le a_i \le 10^4$.

Subtask 3 (50 points): $1 \le k \le n \le 1000$, $-10^9 \le a_i \le 10^9$.

Examples

Input

6 3
3 1 4 1 5 9

Output

1 5 9

Explanation

Here $n=6$ and $k=3$. The first required index is $n-k=6-3=3$. Thus we print $a_3,a_4,a_5$, namely 1 5 9.