{"raw_statement":[{"iden":"problem statement","content":"Takahashi loves takoyaki - a ball-shaped snack.\nWith a takoyaki machine, he can make at most $X$ pieces of takoyaki at a time, taking $T$ minutes regardless of the number of pieces to make.\nHow long does it take to make $N$ takoyaki?"},{"iden":"constraints","content":"*   $1 \\leq N,X,T \\leq 1000$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $X$ $T$"},{"iden":"sample input 1","content":"20 12 6"},{"iden":"sample output 1","content":"12\n\nHe can make $12$ pieces of takoyaki in the first $6$ minutes and $8$ more in the next $6$ minutes, so he can make $20$ in a total of $12$ minutes.\nNote that being able to make $12$ in $6$ minutes does not mean he can make $2$ in $1$ minute."},{"iden":"sample input 2","content":"1000 1 1000"},{"iden":"sample output 2","content":"1000000\n\nIt seems to take a long time to make this kind of takoyaki."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}