New illusion#613

New illusion

1 second

128 megabytes

Very easy

The hero of the first round of NetOI-2000 Illusion, a circus magician, enters the arena with a new trick. He asks the audience to name a two-digit number $n$ , and then asks them to specify the number $k$ of conversions. He explains that the conversion of a two-digit number $n$ is the two-digit number formed from the first two digits of the number $n^{2}$ n^2. For example, the conversion of $30$ is $90$ , and the conversion of $75$ is $56$ . Instantly, he names the number that results from $n$ after $k$ conversions. Write a program that does the same.

Input

Two numbers $n$ ( $10 \leq n \leq 99$ 10 \leq n \leq 99) and $k$ ( $1 \leq k \leq 1 0^{9}$ 1 \leq k \leq 10^9).

Output

Print the number obtained from $n$ after $k$ conversions.

Examples

Example 1

Loading

n^{2}

10 \leq n \leq 99

1 \leq k \leq 1 0^{9}