{"raw_statement":[{"iden":"problem statement","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$.\n\nPrint all the elements of $A$ after the operations."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 100$\n*   $1 \\leq K \\leq 100$\n*   $1 \\leq A_i \\leq 100$\n*   All values in the input are integers."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$ $K$\n$A_1$ $A_2$ $\\dots$ $A_N$"},{"iden":"sample input 1","content":"3 2\n2 7 8"},{"iden":"sample output 1","content":"8 0 0\n\nBefore the operations, $A = (2, 7, 8)$.  \nAfter performing the operation once, $A = (7, 8, 0)$.  \nAfter performing the operation twice, $A = (8, 0, 0)$.  \nThus, $(8, 0, 0)$ is the answer."},{"iden":"sample input 2","content":"3 4\n9 9 9"},{"iden":"sample output 2","content":"0 0 0"},{"iden":"sample input 3","content":"9 5\n1 2 3 4 5 6 7 8 9"},{"iden":"sample output 3","content":"6 7 8 9 0 0 0 0 0"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}