{"raw_statement":[{"iden":"problem statement","content":"Given a non-negative integer $X$, perform the following operation for $i=1,2,\\dots,K$ in this order and find the resulting $X$.\n\n*   Round $X$ off to the nearest $10^i$.\n    *   Formally, replace $X$ with $Y$ that is \"the largest multiple of $10^i$ that minimizes $|Y-X|$.\"\n    *   Here are some examples:\n        *   Rounding $273$ off to the nearest $10^2$ yields $300$.\n        *   Rounding $999$ off to the nearest $10^3$ yields $1000$.\n        *   Rounding $100$ off to the nearest $10^{10}$ yields $0$.\n        *   Rounding $1015$ off to the nearest $10^1$ yields $1020$."},{"iden":"constraints","content":"*   $X$ and $K$ are integers.\n*   $0 \\le X < 10^{15}$\n*   $1 \\le K \\le 15$"},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$X$ $K$"},{"iden":"sample input 1","content":"2048 2"},{"iden":"sample output 1","content":"2100\n\n$X$ changes as $2048 \\rightarrow 2050 \\rightarrow 2100$ by the operations."},{"iden":"sample input 2","content":"1 15"},{"iden":"sample output 2","content":"0"},{"iden":"sample input 3","content":"999 3"},{"iden":"sample output 3","content":"1000"},{"iden":"sample input 4","content":"314159265358979 12"},{"iden":"sample output 4","content":"314000000000000\n\n$X$ may not fit into a $32$\\-bit integer type."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}