407041: GYM102697 012 Easy Exponentials

Memory Limit:256 MB Time Limit:1 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

012. Easy Exponentialstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard output

In the last contest, you were asked to find the last digit of a very large number. This time, you are asked to find the entirety of a much smaller number: your task is to find the first number taken to the power of second number. A brute force approach does work here.

Input

The only line of input contains two space-separated integers n and k, 1 <= n, k <= 10.

Output

Output a single integer: the number $$$n^{k}$$$.

ExampleInput
3 5
Output
243

加入题单

上一题 下一题 算法标签: