1676 - A fearless old driver

Time Limit : 1 Second

Memory Limit : 512 MB

Submission: 28

Solved: 10

Description

With the help of the Minieye, Jane drives very well. One day, she was stopped by the traffic police, because they suspected her of drinking and driving.In order to prove that she was innocent, Jane, a fearless old driver, decided to solve a difficult mental arithmetic. She asked the police to give her a number m (0 < m < 2^64) and she would divide m into n parts, and make the product of these n parts maximum.However, the traffic police wasn't good at math, so they need your help to check whether the answer was right.

Input

We have multiply cases. For each case:


One line contains two integers, m, n. (1<= n <= 20)

Output

The maximum product of these n parts.

sample input
321 2
sample output
63
hint

321 -> 3 * 21 = 63

source
© 2015 HUST ACMICPC TEAM. All Right Reserved.