You are given a sequence $A = (A_1, A_2, \dots, A_N)$ of length $N$. You perform the following operation exactly $K$ times: - remove the initial element of $A$ and append a $0$ to the tail of $A$. Print all the elements of $A$ after the operations.

The input is given from Standard Input in the following format: >$N$ $K$\ >$A_1$ $A_2$ $\dots$ $A_N$ #### Constraints - $1 \leq N \leq 100$ - $1 \leq K \leq 100$ - $1 \leq A_i \leq 100$ - All values in the input are integers.

Print the elements of $A$ after the operations in one line, separated by spaces.

***For Sample #1:*** Before the operations, $A = (2, 7, 8)$. After performing the operation once, $A = (7, 8, 0)$. After performing the operation twice, $A = (8, 0, 0)$. Thus, $(8, 0, 0)$ is the answer.

AtCoder [ABC278A]