{"raw_statement":[{"iden":"problem statement","content":"There are $N$ balls placed in a row. AtCoDeer the deer is painting each of these in one of the $K$ colors of his paint cans. For aesthetic reasons, any two adjacent balls must be painted in different colors.\nFind the number of the possible ways to paint the balls."},{"iden":"constraints","content":"*   $1≦N≦1000$\n*   $2≦K≦1000$\n*   The correct answer is at most $2^{31}-1$."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$ $K$"},{"iden":"sample input 1","content":"2 2"},{"iden":"sample output 1","content":"2\n\nWe will denote the colors by $0$ and $1$. There are two possible ways: we can either paint the left ball in color $0$ and the right ball in color $1$, or paint the left in color $1$ and the right in color $0$."},{"iden":"sample input 2","content":"1 10"},{"iden":"sample output 2","content":"10\n\nSince there is only one ball, we can use any of the ten colors to paint it. Thus, the answer is ten."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}