Shift

AtCoder

IDabc278_a

Time2000ms

Memory256MB

Difficulty—

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. ## Constraints * $1 \leq N \leq 100$ * $1 \leq K \leq 100$ * $1 \leq A_i \leq 100$ * All values in the input are integers. ## Input The input is given from Standard Input in the following format: $N$ $K$ $A_1$ $A_2$ $\dots$ $A_N$ [samples]

Samples

Input #1

3 2
2 7 8

Output #1

8 0 0

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.

Input #2

3 4
9 9 9

Output #2

0 0 0

Input #3

9 5
1 2 3 4 5 6 7 8 9

Output #3

6 7 8 9 0 0 0 0 0

API Response (JSON)

{
  "problem": {
    "name": "Shift",
    "description": {
      "content": "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$",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc278_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "You are given a sequence $A = (A_1, A_2, \\dots, A_N)$ of length $N$.  \nYou perform the following operation exactly $K$ times:\n\n*   remove the initial element of $A$ and append a $0$ to the tail of $A$...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments